Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Advances in contemporary logic and computer science : proceedings of the Eleventh Brazilian Conference on Mathematical Logic, May 6-10, 1996, Salvador da Bahia, Brazil / / Walter A. Carnielli, Itala M.L. D'Ottaviano, editors
| Advances in contemporary logic and computer science : proceedings of the Eleventh Brazilian Conference on Mathematical Logic, May 6-10, 1996, Salvador da Bahia, Brazil / / Walter A. Carnielli, Itala M.L. D'Ottaviano, editors |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , 1999 |
| Descrizione fisica | 1 online resource (344 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Contemporary mathematics |
| Soggetto topico |
Computer logic
Logic, Symbolic and mathematical |
| Soggetto genere / forma | Electronic books. |
| ISBN | 0-8218-7826-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
""Contents""; ""Preface""; ""Part I. Advances in Logic""; ""The mathematical structure of logical syntax""; ""Quantifiers for reasoning with imperfect information and Σ11-logic""; ""Society semantics and multiple-valued logics""; ""A topological approach to the logic underlying fuzzy subset theory""; ""Categorical logic with partial elements""; ""Algebraic K-theory of fields and special groups""; ""Closed ideals of MV-algebras""; ""Definitions of adjunction""; ""A reduced spectrum for MV-algebras""; ""Part II. Advances in Theoretical Computer Science""
""A tableau calculus for Dummett predicate logic""""A hierarchy of unbounded almost rigid classes of finite structures""; ""Some connections between logic and computer science""; ""1. Introduction""; ""2. Logic and Computing: some connections""; ""3. Logical Specifications""; ""4. Fork Algebras""; ""5. Conclusion""; ""Part III. Advances in Philosophical Logic""; ""Opaque predicates, veiled sets and their logic""; ""Truth, quasi-truth and paraconsistency""; ""To be a Fregean or to be a Husserlian: That is the question for Platonists"" ""A modal framework for consequential implication and the factor law"" |
| Record Nr. | UNINA-9910480539003321 |
| Providence, Rhode Island : , : American Mathematical Society, , 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in contemporary logic and computer science : proceedings of the Eleventh Brazilian Conference on Mathematical Logic, May 6-10, 1996, Salvador da Bahia, Brazil / / Walter A. Carnielli, Itala M.L. D'Ottaviano, editors
| Advances in contemporary logic and computer science : proceedings of the Eleventh Brazilian Conference on Mathematical Logic, May 6-10, 1996, Salvador da Bahia, Brazil / / Walter A. Carnielli, Itala M.L. D'Ottaviano, editors |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , 1999 |
| Descrizione fisica | 1 online resource (344 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Contemporary mathematics |
| Soggetto topico |
Computer logic
Logic, Symbolic and mathematical |
| ISBN | 0-8218-7826-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
""Contents""; ""Preface""; ""Part I. Advances in Logic""; ""The mathematical structure of logical syntax""; ""Quantifiers for reasoning with imperfect information and Σ11-logic""; ""Society semantics and multiple-valued logics""; ""A topological approach to the logic underlying fuzzy subset theory""; ""Categorical logic with partial elements""; ""Algebraic K-theory of fields and special groups""; ""Closed ideals of MV-algebras""; ""Definitions of adjunction""; ""A reduced spectrum for MV-algebras""; ""Part II. Advances in Theoretical Computer Science""
""A tableau calculus for Dummett predicate logic""""A hierarchy of unbounded almost rigid classes of finite structures""; ""Some connections between logic and computer science""; ""1. Introduction""; ""2. Logic and Computing: some connections""; ""3. Logical Specifications""; ""4. Fork Algebras""; ""5. Conclusion""; ""Part III. Advances in Philosophical Logic""; ""Opaque predicates, veiled sets and their logic""; ""Truth, quasi-truth and paraconsistency""; ""To be a Fregean or to be a Husserlian: That is the question for Platonists"" ""A modal framework for consequential implication and the factor law"" |
| Record Nr. | UNINA-9910788651903321 |
| Providence, Rhode Island : , : American Mathematical Society, , 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in contemporary logic and computer science : proceedings of the Eleventh Brazilian Conference on Mathematical Logic, May 6-10, 1996, Salvador da Bahia, Brazil / / Walter A. Carnielli, Itala M.L. D'Ottaviano, editors
| Advances in contemporary logic and computer science : proceedings of the Eleventh Brazilian Conference on Mathematical Logic, May 6-10, 1996, Salvador da Bahia, Brazil / / Walter A. Carnielli, Itala M.L. D'Ottaviano, editors |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , 1999 |
| Descrizione fisica | 1 online resource (344 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Contemporary mathematics |
| Soggetto topico |
Computer logic
Logic, Symbolic and mathematical |
| ISBN | 0-8218-7826-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
""Contents""; ""Preface""; ""Part I. Advances in Logic""; ""The mathematical structure of logical syntax""; ""Quantifiers for reasoning with imperfect information and Σ11-logic""; ""Society semantics and multiple-valued logics""; ""A topological approach to the logic underlying fuzzy subset theory""; ""Categorical logic with partial elements""; ""Algebraic K-theory of fields and special groups""; ""Closed ideals of MV-algebras""; ""Definitions of adjunction""; ""A reduced spectrum for MV-algebras""; ""Part II. Advances in Theoretical Computer Science""
""A tableau calculus for Dummett predicate logic""""A hierarchy of unbounded almost rigid classes of finite structures""; ""Some connections between logic and computer science""; ""1. Introduction""; ""2. Logic and Computing: some connections""; ""3. Logical Specifications""; ""4. Fork Algebras""; ""5. Conclusion""; ""Part III. Advances in Philosophical Logic""; ""Opaque predicates, veiled sets and their logic""; ""Truth, quasi-truth and paraconsistency""; ""To be a Fregean or to be a Husserlian: That is the question for Platonists"" ""A modal framework for consequential implication and the factor law"" |
| Record Nr. | UNINA-9910828537603321 |
| Providence, Rhode Island : , : American Mathematical Society, , 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science Logic [[electronic resource] ] : 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings / / edited by Jerzy Marcinkowski
| Computer Science Logic [[electronic resource] ] : 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings / / edited by Jerzy Marcinkowski |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XI, 522 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Mathematical logic Artificial intelligence Computer logic Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Artificial Intelligence Logics and Meanings of Programs |
| ISBN | 3-540-30124-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Notions of Average-Case Complexity for Random 3-SAT -- Abstract Interpretation of Proofs: Classical Propositional Calculus -- Applications of Craig Interpolation to Model Checking -- Bindings, Mobility of Bindings, and the ?-Quantifier: An Abstract -- My (Un)Favourite Things -- Regular Papers -- On Nash Equilibria in Stochastic Games -- A Bounding Quantifier -- Parity and Exploration Games on Infinite Graphs -- Integrating Equational Reasoning into Instantiation-Based Theorem Proving -- Goal-Directed Methods for ?ukasiewicz Logic -- A General Theorem on Termination of Rewriting -- Predicate Transformers and Linear Logic: Yet Another Denotational Model -- Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity -- On Proof Nets for Multiplicative Linear Logic with Units -- The Boundary Between Decidability and Undecidability for Transitive-Closure Logics -- Game-Based Notions of Locality Over Finite Models -- Fixed Points of Type Constructors and Primitive Recursion -- On the Building of Affine Retractions -- Higher-Order Matching in the Linear ?-calculus with Pairing -- A Dependent Type Theory with Names and Binding -- Towards Mechanized Program Verification with Separation Logic -- A Functional Scenario for Bytecode Verification of Resource Bounds -- Proving Abstract Non-interference -- Intuitionistic LTL and a New Characterization of Safety and Liveness -- Moving in a Crumbling Network: The Balanced Case -- Parameterized Model Checking of Ring-Based Message Passing Systems -- A Third-Order Bounded Arithmetic Theory for PSPACE -- Provably Total Primitive Recursive Functions: Theories with Induction -- Logical Characterizations of PSPACE -- The Logic of the Partial ?-Calculus with Equality -- Complete Lax Logical Relations for Cryptographic Lambda-Calculi -- Subtyping Union Types -- Pfaffian Hybrid Systems -- Axioms for Delimited Continuations in the CPS Hierarchy -- Set Constraints on Regular Terms -- Unsound Theorem Proving -- A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation -- Automated Generation of Analytic Calculi for Logics with Linearity. |
| Record Nr. | UNISA-996465402603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings / / edited by Jerzy Marcinkowski
| Computer Science Logic [[electronic resource] ] : 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings / / edited by Jerzy Marcinkowski |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XI, 522 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Mathematical logic Artificial intelligence Computer logic Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Artificial Intelligence Logics and Meanings of Programs |
| ISBN | 3-540-30124-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Notions of Average-Case Complexity for Random 3-SAT -- Abstract Interpretation of Proofs: Classical Propositional Calculus -- Applications of Craig Interpolation to Model Checking -- Bindings, Mobility of Bindings, and the ?-Quantifier: An Abstract -- My (Un)Favourite Things -- Regular Papers -- On Nash Equilibria in Stochastic Games -- A Bounding Quantifier -- Parity and Exploration Games on Infinite Graphs -- Integrating Equational Reasoning into Instantiation-Based Theorem Proving -- Goal-Directed Methods for ?ukasiewicz Logic -- A General Theorem on Termination of Rewriting -- Predicate Transformers and Linear Logic: Yet Another Denotational Model -- Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity -- On Proof Nets for Multiplicative Linear Logic with Units -- The Boundary Between Decidability and Undecidability for Transitive-Closure Logics -- Game-Based Notions of Locality Over Finite Models -- Fixed Points of Type Constructors and Primitive Recursion -- On the Building of Affine Retractions -- Higher-Order Matching in the Linear ?-calculus with Pairing -- A Dependent Type Theory with Names and Binding -- Towards Mechanized Program Verification with Separation Logic -- A Functional Scenario for Bytecode Verification of Resource Bounds -- Proving Abstract Non-interference -- Intuitionistic LTL and a New Characterization of Safety and Liveness -- Moving in a Crumbling Network: The Balanced Case -- Parameterized Model Checking of Ring-Based Message Passing Systems -- A Third-Order Bounded Arithmetic Theory for PSPACE -- Provably Total Primitive Recursive Functions: Theories with Induction -- Logical Characterizations of PSPACE -- The Logic of the Partial ?-Calculus with Equality -- Complete Lax Logical Relations for Cryptographic Lambda-Calculi -- Subtyping Union Types -- Pfaffian Hybrid Systems -- Axioms for Delimited Continuations in the CPS Hierarchy -- Set Constraints on Regular Terms -- Unsound Theorem Proving -- A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation -- Automated Generation of Analytic Calculi for Logics with Linearity. |
| Record Nr. | UNINA-9910767565303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science Logic [[electronic resource] ] : 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings / / edited by Matthias Baaz, Johann M. Makowsky
| Computer Science Logic [[electronic resource] ] : 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings / / edited by Matthias Baaz, Johann M. Makowsky |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 596 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computer logic Artificial intelligence Mathematical Logic and Formal Languages Science, Humanities and Social Sciences, multidisciplinary Logics and Meanings of Programs Artificial Intelligence Mathematical Logic and Foundations |
| ISBN | 3-540-45220-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Deciding Monotonic Games -- The Commuting V-Diagram -- Concurrent Construction of Proof-Nets -- Back to the Future: Explicit Logic for Computer Science -- Constraint Satisfaction with Countable Homogeneous Templates -- Quantified Constraints: Algorithms and Complexity -- Verification of Infinite State Systems -- Parity of Imperfection or Fixing Independence -- Atomic Cut Elimination for Classical Logic -- Computational Mathematics, Computational Logic, and Symbolic Computation -- Simple Stochastic Parity Games -- Machine Characterizations of the Classes of the W-Hierarchy -- Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions -- On Relativisation and Complexity Gap for Resolution-Based Proof Systems -- Strong Normalization of the Typed ? ws -Calculus -- A Fixed-Point Logic with Symmetric Choice -- Positive Games and Persistent Strategies -- Generating All Abductive Explanations for Queries on Propositional Horn Theories -- Refined Complexity Analysis of Cut Elimination -- Comparing the Succinctness of Monadic Query Languages over Finite Trees -- The Arithmetical Complexity of Dimension and Randomness -- Towards a Proof System for Admissibility -- Program Complexity of Dynamic LTL Model Checking -- Coping Polynomially with Numerous but Identical Elements within Planning Problems -- On Algebraic Specifications of Abstract Data Types -- On the Complexity of Existential Pebble Games -- Computational Aspects of ?-Definability over the Real Numbers without the Equality Test -- The Surprising Power of Restricted Programs and Gödel’s Functionals -- Pebble Games on Trees -- Bistability: An Extensional Characterization of Sequentiality -- Automata on Lempel-Ziv Compressed Strings -- Complexity of Some Problems in Modal and Intuitionistic Calculi -- Goal-Directed Calculi for Gödel-Dummett Logics -- A Logic for Probability in Quantum Systems -- A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory -- The Epsilon Calculus -- Modular Semantics and Logics of Classes -- Validity of CTL Queries Revisited -- Calculi of Meta-variables -- Henkin Models of the Partial ?-Calculus -- Nominal Unification -- Friends or Foes? Communities in Software Verification -- More Computation Power for a Denotational Semantics for First Order Logic -- Effective Model Completeness of the Theory of Restricted Pfaffian Functions -- Effective Quantifier Elimination over Real Closed Fields -- Fast Infinite-State Model Checking in Integer-Based Systems -- Winning Strategies and Synthesis of Controllers -- Logical Relations for Dynamic Name Creation. |
| Record Nr. | UNISA-996465700503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings / / edited by Matthias Baaz, Johann M. Makowsky
| Computer Science Logic [[electronic resource] ] : 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings / / edited by Matthias Baaz, Johann M. Makowsky |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 596 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computer logic Artificial intelligence Mathematical Logic and Formal Languages Science, Humanities and Social Sciences, multidisciplinary Logics and Meanings of Programs Artificial Intelligence Mathematical Logic and Foundations |
| ISBN | 3-540-45220-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Deciding Monotonic Games -- The Commuting V-Diagram -- Concurrent Construction of Proof-Nets -- Back to the Future: Explicit Logic for Computer Science -- Constraint Satisfaction with Countable Homogeneous Templates -- Quantified Constraints: Algorithms and Complexity -- Verification of Infinite State Systems -- Parity of Imperfection or Fixing Independence -- Atomic Cut Elimination for Classical Logic -- Computational Mathematics, Computational Logic, and Symbolic Computation -- Simple Stochastic Parity Games -- Machine Characterizations of the Classes of the W-Hierarchy -- Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions -- On Relativisation and Complexity Gap for Resolution-Based Proof Systems -- Strong Normalization of the Typed ? ws -Calculus -- A Fixed-Point Logic with Symmetric Choice -- Positive Games and Persistent Strategies -- Generating All Abductive Explanations for Queries on Propositional Horn Theories -- Refined Complexity Analysis of Cut Elimination -- Comparing the Succinctness of Monadic Query Languages over Finite Trees -- The Arithmetical Complexity of Dimension and Randomness -- Towards a Proof System for Admissibility -- Program Complexity of Dynamic LTL Model Checking -- Coping Polynomially with Numerous but Identical Elements within Planning Problems -- On Algebraic Specifications of Abstract Data Types -- On the Complexity of Existential Pebble Games -- Computational Aspects of ?-Definability over the Real Numbers without the Equality Test -- The Surprising Power of Restricted Programs and Gödel’s Functionals -- Pebble Games on Trees -- Bistability: An Extensional Characterization of Sequentiality -- Automata on Lempel-Ziv Compressed Strings -- Complexity of Some Problems in Modal and Intuitionistic Calculi -- Goal-Directed Calculi for Gödel-Dummett Logics -- A Logic for Probability in Quantum Systems -- A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory -- The Epsilon Calculus -- Modular Semantics and Logics of Classes -- Validity of CTL Queries Revisited -- Calculi of Meta-variables -- Henkin Models of the Partial ?-Calculus -- Nominal Unification -- Friends or Foes? Communities in Software Verification -- More Computation Power for a Denotational Semantics for First Order Logic -- Effective Model Completeness of the Theory of Restricted Pfaffian Functions -- Effective Quantifier Elimination over Real Closed Fields -- Fast Infinite-State Model Checking in Integer-Based Systems -- Winning Strategies and Synthesis of Controllers -- Logical Relations for Dynamic Name Creation. |
| Record Nr. | UNINA-9910143855403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science Logic [[electronic resource] ] : 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September / / edited by Julian Bradfield
| Computer Science Logic [[electronic resource] ] : 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September / / edited by Julian Bradfield |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 628 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Programming languages (Electronic computers) Mathematical logic Artificial intelligence Computer logic Theory of Computation Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-45793-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Limit-Computable Mathematics and Its Applications -- Automata, Logic, and XML -- ?-Calculus via Games (Extended Abstract) -- Rewriting and Constructive Mathematics -- Bijections between Partitions by Two-Directional Rewriting Techniques -- On Continuous Normalization -- Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle -- Compactness and Continuity, Constructively Revisited -- Fixpoints and Recursion -- Hoare Logics for Recursive Procedures and Unbounded Nondeterminism -- A Fixpoint Theory for Non-monotonic Parallelism -- Greibach Normal Form in Algebraically Complete Semirings -- Linear and Resource Logics -- Proofnets and Context Semantics for the Additives -- A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming -- Resource Tableaux -- Semantics -- Configuration Theories -- A Logic for Probabilities in Semantics -- Possible World Semantics for General Storage in Call-By-Value -- A Fully Abstract Relational Model of Syntactic Control of Interference -- Temporal Logics and Games -- Optimal Complexity Bounds for Positive LTL Games -- The Stuttering Principle Revisited: On the Expressiveness of Nested X and ? Operators in the Logic LTL -- Trading Probability for Fairness -- Probability, Games and Fixpoints -- A Logic of Probability with Decidable Model-Checking -- Solving Pushdown Games with a ?3 Winning Condition -- Partial Fixed-Point Logic on Infinite Structures -- On the Variable Hierarchy of the Modal ?-Calculus -- Complexity and Proof Complexity -- Implicit Computational Complexity for Higher Type Functionals -- On Generalizations of Semi-terms of Particularly Simple Form -- Local Problems, Planar Local Problems and Linear Time -- Equivalence and Isomorphism for Boolean Constraint Satisfaction -- Ludics and Linear Logic -- Travelling on Designs -- Designs, Disputes and Strategies -- Classical Linear Logic of Implications -- Lambda-Calculi -- Higher-Order Positive Set Constraints -- A Proof Theoretical Account of Continuation Passing Style -- Duality between Call-by-Name Recursion and Call-by-Value Iteration -- Decidability of Bounded Higher-Order Unification -- Open Proofs and Open Terms: A Basis for Interactive Logic -- Logical Relations for Monadic Types -- Resolution and Proofs -- On the Automatizability of Resolution and Related Propositional Proof Systems -- Extraction of Proofs from the Clausal Normal Form Transformation -- Resolution Refutations and Propositional Proofs with Height-Restrictions. |
| Altri titoli varianti | 22-25, 2002, Proceedings |
| Record Nr. | UNISA-996465524203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September / / edited by Julian Bradfield
| Computer Science Logic [[electronic resource] ] : 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September / / edited by Julian Bradfield |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 628 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Programming languages (Electronic computers) Mathematical logic Artificial intelligence Computer logic Theory of Computation Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-45793-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Limit-Computable Mathematics and Its Applications -- Automata, Logic, and XML -- ?-Calculus via Games (Extended Abstract) -- Rewriting and Constructive Mathematics -- Bijections between Partitions by Two-Directional Rewriting Techniques -- On Continuous Normalization -- Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle -- Compactness and Continuity, Constructively Revisited -- Fixpoints and Recursion -- Hoare Logics for Recursive Procedures and Unbounded Nondeterminism -- A Fixpoint Theory for Non-monotonic Parallelism -- Greibach Normal Form in Algebraically Complete Semirings -- Linear and Resource Logics -- Proofnets and Context Semantics for the Additives -- A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming -- Resource Tableaux -- Semantics -- Configuration Theories -- A Logic for Probabilities in Semantics -- Possible World Semantics for General Storage in Call-By-Value -- A Fully Abstract Relational Model of Syntactic Control of Interference -- Temporal Logics and Games -- Optimal Complexity Bounds for Positive LTL Games -- The Stuttering Principle Revisited: On the Expressiveness of Nested X and ? Operators in the Logic LTL -- Trading Probability for Fairness -- Probability, Games and Fixpoints -- A Logic of Probability with Decidable Model-Checking -- Solving Pushdown Games with a ?3 Winning Condition -- Partial Fixed-Point Logic on Infinite Structures -- On the Variable Hierarchy of the Modal ?-Calculus -- Complexity and Proof Complexity -- Implicit Computational Complexity for Higher Type Functionals -- On Generalizations of Semi-terms of Particularly Simple Form -- Local Problems, Planar Local Problems and Linear Time -- Equivalence and Isomorphism for Boolean Constraint Satisfaction -- Ludics and Linear Logic -- Travelling on Designs -- Designs, Disputes and Strategies -- Classical Linear Logic of Implications -- Lambda-Calculi -- Higher-Order Positive Set Constraints -- A Proof Theoretical Account of Continuation Passing Style -- Duality between Call-by-Name Recursion and Call-by-Value Iteration -- Decidability of Bounded Higher-Order Unification -- Open Proofs and Open Terms: A Basis for Interactive Logic -- Logical Relations for Monadic Types -- Resolution and Proofs -- On the Automatizability of Resolution and Related Propositional Proof Systems -- Extraction of Proofs from the Clausal Normal Form Transformation -- Resolution Refutations and Propositional Proofs with Height-Restrictions. |
| Altri titoli varianti | 22-25, 2002, Proceedings |
| Record Nr. | UNINA-9910143892303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science Logic [[electronic resource] ] : 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings / / edited by Laurent Fribourg
| Computer Science Logic [[electronic resource] ] : 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings / / edited by Laurent Fribourg |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 628 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Artificial intelligence Mathematical logic Computer logic Programming Languages, Compilers, Interpreters Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-44802-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Local Reasoning about Programs that Alter Data Structures -- Applications of Alfred Tarski’s Ideas in Database Theory -- Locus Solum: From the Rules of Logic to the Logic of Rules -- Contributed Papers -- The Expressive Power of Horn Monadic Linear Logic -- Non-commutativity and MELL in the Calculus of Structures -- Quadratic Correctness Criterion for Non-commutative Logic -- Descriptive Complexity -- Capture Complexity by Partition -- An Existential Locality Theorem -- Actual Arithmetic and Feasibility -- The Natural Order-Generic Collapse for ?-Representable Databases over the Rational and the Real Ordered Group -- Semantics -- An Algebraic Foundation for Higraphs -- Semantic Characterisations of Second-Order Computability over the Real Numbers -- An Abstract Look at Realizability -- The Anatomy of Innocence -- Higher-Order Programs -- An Improved Extensionality Criterion for Higher-Order Logic Programs -- A Logic for Abstract State Machines -- Constrained Hyper Tableaux -- Modal Logics -- Modal Logic and the Two-Variable Fragment -- A Logic for Approximate First-Order Reasoning -- Inflationary Fixed Points in Modal Logic -- Categorical and Kripke Semantics for Constructive S4 Modal Logic -- Verification -- Labelled Natural Deduction for Interval Logics -- Decidable Navigation Logics for Object Structures -- The Decidability of Model Checking Mobile Ambients -- Automata -- A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem -- An Effective Extension of the Wagner Hierarchy to Blind Counter Automata -- Decision Procedure for an Extension of WS1S -- Lambda-Calculus -- Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic -- Intersection Logic -- Life without the Terminal Type -- Fully Complete Minimal PER Models for the Simply Typed ?-Calculus -- Induction -- A Principle of Induction -- On a Generalisation of Herbrand’s Theorem -- Well-Founded Recursive Relations -- Equational Calculus -- Stratified Context Unification Is in PSPACE -- Uniform Derivation of Decision Procedures by Superposition -- Complete Categorical Equational Deduction -- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories -- Constructive Theory of Types -- Normalized Types -- Markov’s Principle for Propositional Type Theory -- Recursion for Higher-Order Encodings -- Monotone Inductive and Coinductive Constructors of Rank 2. |
| Record Nr. | UNINA-9910143627603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
