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.
Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (297 pages) |
| Disciplina | 003.54 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematical logic
Machine theory Artificial intelligence Mathematical Logic and Foundations Formal Languages and Automata Theory Artificial Intelligence |
| ISBN | 3-030-36755-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computability of Algebraic and Definable Closure -- Observable Models -- Countermodel Construction via Optimal Hypersequent Calculi for Non-Normal Modal Logics -- Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory -- On the Constructive Truth and Falsity in Peano Arithmetic -- Belief Expansion in Subset Models -- Finitism, Concrete Programs and Primitive Recursion -- Knowledge of Uncertain Worlds: Programming with Logical Constraints -- A Globally Sound Analytic Calculus for Henkin Quantifiers -- Feedback Hyperjump -- Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents -- On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems -- Parameterised Complexity of Abduction in Schaefer's Framework -- Tracking Computability of GPAC-Generable Functions -- Modal Type Theory Based on the Intuitionistic Modal Logic ������������! -- Lifting Recursive Counterexamples to Higher-Order Arithmetic -- On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem under Semantic Tableaux Deduction. |
| Record Nr. | UNISA-996418291003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logical Foundations of Computer Science : International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science : International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (297 pages) |
| Disciplina |
003.54
004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematical logic
Machine theory Artificial intelligence Mathematical Logic and Foundations Formal Languages and Automata Theory Artificial Intelligence |
| ISBN | 3-030-36755-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computability of Algebraic and Definable Closure -- Observable Models -- Countermodel Construction via Optimal Hypersequent Calculi for Non-Normal Modal Logics -- Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory -- On the Constructive Truth and Falsity in Peano Arithmetic -- Belief Expansion in Subset Models -- Finitism, Concrete Programs and Primitive Recursion -- Knowledge of Uncertain Worlds: Programming with Logical Constraints -- A Globally Sound Analytic Calculus for Henkin Quantifiers -- Feedback Hyperjump -- Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents -- On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems -- Parameterised Complexity of Abduction in Schaefer's Framework -- Tracking Computability of GPAC-Generable Functions -- Modal Type Theory Based on the Intuitionistic Modal Logic ������������! -- Lifting Recursive Counterexamples to Higher-Order Arithmetic -- On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem under Semantic Tableaux Deduction. |
| Record Nr. | UNINA-9910484692303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018, Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018, Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 369 p. 17 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer arithmetic and logic units Computer science Artificial intelligence Compilers (Computer programs) Computer programming Formal Languages and Automata Theory Arithmetic and Logic Structures Computer Science Logic and Foundations of Programming Artificial Intelligence Compilers and Interpreters Programming Techniques |
| ISBN | 3-319-72056-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constructive mathematics and type theory -- Homotopy type theory -- Logic, automata, and automatic structures -- Computability and randomness -- Logical foundations of programming -- Logical aspects of computational complexity -- Parameterized complexity -- Logic programming and constraints -- Automated deduction and interactive theorem proving -- Logical methods in protocol and program verification -- Logical methods in program specification and extraction -- Domain theory logics -- Logical foundations of database theory -- Equational logic and term rewriting -- Lambda and combinatory calculi -- Categorical logic and topological semantics -- Linear logic -- Epistemic and temporal logics -- Intelligent and multiple-agent system logics -- Logics of proof and justification -- Non-monotonic reasoning -- Logic in game theory and social software -- Logic of hybrid systems -- Distributed system logics -- Mathematical fuzzy logic -- System design logics. |
| Record Nr. | UNISA-996465506103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logical Foundations of Computer Science : International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018, Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science : International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018, Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 369 p. 17 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer arithmetic and logic units Computer science Artificial intelligence Compilers (Computer programs) Computer programming Formal Languages and Automata Theory Arithmetic and Logic Structures Computer Science Logic and Foundations of Programming Artificial Intelligence Compilers and Interpreters Programming Techniques |
| ISBN | 3-319-72056-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constructive mathematics and type theory -- Homotopy type theory -- Logic, automata, and automatic structures -- Computability and randomness -- Logical foundations of programming -- Logical aspects of computational complexity -- Parameterized complexity -- Logic programming and constraints -- Automated deduction and interactive theorem proving -- Logical methods in protocol and program verification -- Logical methods in program specification and extraction -- Domain theory logics -- Logical foundations of database theory -- Equational logic and term rewriting -- Lambda and combinatory calculi -- Categorical logic and topological semantics -- Linear logic -- Epistemic and temporal logics -- Intelligent and multiple-agent system logics -- Logics of proof and justification -- Non-monotonic reasoning -- Logic in game theory and social software -- Logic of hybrid systems -- Distributed system logics -- Mathematical fuzzy logic -- System design logics. |
| Record Nr. | UNINA-9910349264403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (X, 407 p. 33 illus. in color.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Formal Languages and Automata Theory |
| ISBN | 3-319-27683-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constructive mathematics and type theory -- Homotopy type theory -- Logic, automata, and automatic structures -- Computability and randomness -- Logical foundations of programming -- Logical aspects of computational complexity -- Parameterized complexity -- Logic programming and constraints -- Automated deduction and interactive theorem proving -- Logical methods in protocol and program verification -- Logical methods in program specification and extraction -- Domain theory logics -- Logical foundations of database theory -- Equational logic and term rewriting -- Lambda and combinatory calculi -- Categorical logic and topological semantics -- Linear logic -- Epistemic and temporal logics -- Intelligent and multiple-agent system logics -- Logics of proof and justification -- Non-monotonic reasoning -- Logic in game theory and social software -- Logic of hybrid systems -- Distributed system logics -- Mathematical fuzzy logic -- System design logics. |
| Record Nr. | UNISA-996202815403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logical Foundations of Computer Science : International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science : International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (X, 407 p. 33 illus. in color.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Formal Languages and Automata Theory |
| ISBN | 3-319-27683-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constructive mathematics and type theory -- Homotopy type theory -- Logic, automata, and automatic structures -- Computability and randomness -- Logical foundations of programming -- Logical aspects of computational complexity -- Parameterized complexity -- Logic programming and constraints -- Automated deduction and interactive theorem proving -- Logical methods in protocol and program verification -- Logical methods in program specification and extraction -- Domain theory logics -- Logical foundations of database theory -- Equational logic and term rewriting -- Lambda and combinatory calculi -- Categorical logic and topological semantics -- Linear logic -- Epistemic and temporal logics -- Intelligent and multiple-agent system logics -- Logics of proof and justification -- Non-monotonic reasoning -- Logic in game theory and social software -- Logic of hybrid systems -- Distributed system logics -- Mathematical fuzzy logic -- System design logics. |
| Record Nr. | UNINA-9910481962303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 415 p. 49 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer arithmetic and logic units Computer science Compilers (Computer programs) Mathematical logic Formal Languages and Automata Theory Arithmetic and Logic Structures Computer Science Logic and Foundations of Programming Theory of Computation Compilers and Interpreters Mathematical Logic and Foundations |
| ISBN | 3-642-35722-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constructive mathematics and type theory -- Logic, automata and automatic structures -- Computability and randomness -- Logical foundations of programming -- Logical aspects of computational complexity -- Logic programming and constraints -- Automated deduction and interactive theorem proving -- Logical methods in protocol and program verification -- Logical methods in program specification and extraction -- Domain theory logic -- Logical foundations of database theory -- Equational logic and term rewriting -- Lambda and combinatory calculi -- Categorical logic and topological semantics -- Linear logic -- Epistemic and temporal logics -- Intelligent and multiple agent system logics -- Logics of proof and justification -- Nonmonotonic reasoning -- Logic in game theory and social software -- Logic of hybrid systems -- Distributed system logics -- Mathematical fuzzy logic -- System design logics. |
| Record Nr. | UNISA-996466001403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 469 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Mathematical logic Machine theory Computer arithmetic and logic units Computer science—Mathematics Computer Science Logic and Foundations of Programming Mathematical Logic and Foundations Formal Languages and Automata Theory Arithmetic and Logic Structures Symbolic and Algebraic Manipulation |
| ISBN | 3-540-92687-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications of Finite Duality to Locally Finite Varieties of BL-Algebras -- Completeness Results for Memory Logics -- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination -- Temporalization of Probabilistic Propositional Logic -- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings -- The Logic of Proofs as a Foundation for Certifying Mobile Computation -- ATL with Strategy Contexts and Bounded Memory -- A Relational Model of a Parallel and Non-deterministic ?-Calculus -- The NP-Completeness of Reflected Fragments of Justification Logics -- Taming Modal Impredicativity: Superlazy Reduction -- Positive Fork Graph Calculus -- Games on Strings with a Limited Order Relation -- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees -- Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic -- A Clausal Approach to Proof Analysis in Second-Order Logic -- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics -- Light Linear Logic with Controlled Weakening -- Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm -- Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System -- Tableaux and Hypersequents for Justification Logic -- Topological Forcing Semantics with Settling -- Automata and Answer Set Programming -- A Labeled Natural Deduction System for a Fragment of CTL * -- Conservativity for Logics of Justified Belief -- Unifying Sets and Programs via Dependent Types -- Product-Free Lambek Calculus Is NP-Complete -- Games on Multi-stack Pushdown Systems -- Data Privacy for Knowledge Bases -- Fixed Point Theorems on Partial Randomness -- Decidability and Undecidability in Probability Logic -- A Bialgebraic Approach to Automata and Formal Language Theory. |
| Record Nr. | UNISA-996465895703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logical Foundations of Computer Science [[electronic resource] ] : 4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings / / edited by Sergei Adian, Anil Nerode
| Logical Foundations of Computer Science [[electronic resource] ] : 4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings / / edited by Sergei Adian, Anil Nerode |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (IX, 436 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Computer logic Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-69065-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Topological semantics for hybrid systems -- Domain-free pure type systems -- Generic queries over quasi-o-minimal domains -- Towards computing distances between programs via Scott domains -- A safe recursion scheme for exponential time -- Finite model theory, universal algebra and graph grammars -- Complexity of query answering in logic databases with complex values -- Recognition of deductive data base stability -- The concurrency complexity for the Horn fragment of linear logic -- Studying algorithmic problems for free semi-groups and groups -- Learning small programs with additional information -- Cut elimination for the second order propositional logic with Hilbert's ?-symbol, extensionality, and full comprehension -- Finite bases of admissible rules for the logic S52 C -- An algebraic correctness criterion for intuitionistic proof-nets -- Towards a theory of recursive structures -- On the complexity of prefix formulas in modal logic of subset spaces -- The undecidability of second order linear affine logic -- Operational logic of proofs with functionality condition on proof predicate -- On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets -- Functions for the general solution of parametric word equations -- A proof procedure for hereditary Harrop formulas with free equality -- Basic forward chaining construction for logic programs -- Decidability and undecidability of the halting problem on Turing machines, a survey -- Case study: Additive linear logic and lattices -- Some decision problems for traces -- Existential instantiation and strong normalization -- Models for the logic of proofs -- Interpretation of the full computation tree logic CTL* on sets of infinite sequences -- Type introduction for equational rewriting -- Capturing bisimulation-invariant Ptime -- Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic -- A decidable fragment of second order linear logic -- Some results on Propositional Dynamic Logic with fixed points -- Quasi-characteristic inference rules for modal logics -- Provability logic with operations on proofs -- Formal verification of logic programs: Foundations and implementation -- Unification of terms with term-indexed variables -- Back-forth equivalences for design of concurrent systems -- Association nets: An alternative formalization of common thinking -- Simulating ?-expansions with ?-reductions in the second-order polymorphic ?-rcalculus -- Logical schemes for first order theories -- Verification of PLTL formulae by means of monotone disjunctive normal forms. |
| Record Nr. | UNINA-9910144921603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logical Foundations of Computer Science [[electronic resource] ] : 4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings / / edited by Sergei Adian, Anil Nerode
| Logical Foundations of Computer Science [[electronic resource] ] : 4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings / / edited by Sergei Adian, Anil Nerode |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (IX, 436 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Computer logic Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-69065-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Topological semantics for hybrid systems -- Domain-free pure type systems -- Generic queries over quasi-o-minimal domains -- Towards computing distances between programs via Scott domains -- A safe recursion scheme for exponential time -- Finite model theory, universal algebra and graph grammars -- Complexity of query answering in logic databases with complex values -- Recognition of deductive data base stability -- The concurrency complexity for the Horn fragment of linear logic -- Studying algorithmic problems for free semi-groups and groups -- Learning small programs with additional information -- Cut elimination for the second order propositional logic with Hilbert's ?-symbol, extensionality, and full comprehension -- Finite bases of admissible rules for the logic S52 C -- An algebraic correctness criterion for intuitionistic proof-nets -- Towards a theory of recursive structures -- On the complexity of prefix formulas in modal logic of subset spaces -- The undecidability of second order linear affine logic -- Operational logic of proofs with functionality condition on proof predicate -- On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets -- Functions for the general solution of parametric word equations -- A proof procedure for hereditary Harrop formulas with free equality -- Basic forward chaining construction for logic programs -- Decidability and undecidability of the halting problem on Turing machines, a survey -- Case study: Additive linear logic and lattices -- Some decision problems for traces -- Existential instantiation and strong normalization -- Models for the logic of proofs -- Interpretation of the full computation tree logic CTL* on sets of infinite sequences -- Type introduction for equational rewriting -- Capturing bisimulation-invariant Ptime -- Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic -- A decidable fragment of second order linear logic -- Some results on Propositional Dynamic Logic with fixed points -- Quasi-characteristic inference rules for modal logics -- Provability logic with operations on proofs -- Formal verification of logic programs: Foundations and implementation -- Unification of terms with term-indexed variables -- Back-forth equivalences for design of concurrent systems -- Association nets: An alternative formalization of common thinking -- Simulating ?-expansions with ?-reductions in the second-order polymorphic ?-rcalculus -- Logical schemes for first order theories -- Verification of PLTL formulae by means of monotone disjunctive normal forms. |
| Record Nr. | UNISA-996465377903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
