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 : International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science : 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 |
| Altri autori (Persone) |
ArtemovS. N
NerodeAnil <1932-> |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer arithmetic and logic units Computer science Compilers (Computer programs) Logic, Symbolic and mathematical 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. | UNINA-9910484250903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logical Foundations of Computer Science : International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science : 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 |
| Altri autori (Persone) |
ArtemovS. N
NerodeAnil <1932-> |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Logic, Symbolic and mathematical 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 BialgebraicApproach to Automata and Formal Language Theory. |
| Record Nr. | UNINA-9910768172103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science [[electronic resource] ] : International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (521 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Mathematical logic Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Mathematical Logic and Foundations |
| ISBN |
1-280-94953-8
9786610949533 3-540-72734-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Justified and Common Knowledge: Limited Conservativity -- The Intensional Lambda Calculus -- Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers -- Elementary Differential Calculus on Discrete and Hybrid Structures -- Weighted Distributed Systems and Their Logics -- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! -- On Decidability and Expressiveness of Propositional Interval Neighborhood Logics -- Reasoning About Sequences of Memory States -- Cut Elimination in Deduction Modulo by Abstract Completion -- Density Elimination and Rational Completeness for First-Order Logics -- Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus -- Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics -- A Decidable Temporal Logic of Repeating Values -- Model Checking Knowledge and Linear Time: PSPACE Cases -- Realizations and LP -- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking -- Explicit Proofs in Formal Provability Logic -- A Synthesis Algorithm for Hybrid Systems -- Including the Past in ‘Topologic’ -- A Note on Rewriting Proofs and Fibonacci Numbers -- On Complexity of Ehrenfeucht-Fraïssé Games -- The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion -- Hypersequent Calculus for Intuitionistic Logic with Classical Atoms -- Proof Identity for Classical Logic: Generalizing to Normality -- On the Constructive Dedekind Reals: Extended Abstract -- Verifying Balanced Trees -- Compactness Properties for Stable Semantics of Logic Programs -- Uniform Circuits, & Boolean Proof Nets -- Finite Automata Presentable Abelian Groups -- Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic -- Some Puzzles About Probability and Probabilistic Conditionals -- A Temporal Dynamic Logic for Verifying Hybrid System Invariants -- Multiplexor Categories and Models of Soft Linear Logic -- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms -- Total Public Announcements. |
| Record Nr. | UNISA-996466262003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logical Foundations of Computer Science : International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings / / edited by Sergei Artemov, Anil Nerode
| Logical Foundations of Computer Science : International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings / / edited by Sergei Artemov, Anil Nerode |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (521 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Logic, Symbolic and mathematical Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Mathematical Logic and Foundations |
| ISBN |
1-280-94953-8
9786610949533 3-540-72734-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Justified and Common Knowledge: Limited Conservativity -- The Intensional Lambda Calculus -- Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers -- Elementary Differential Calculus on Discrete and Hybrid Structures -- Weighted Distributed Systems and Their Logics -- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! -- On Decidability and Expressiveness of Propositional Interval Neighborhood Logics -- Reasoning About Sequences of Memory States -- Cut Elimination in Deduction Modulo by Abstract Completion -- Density Elimination and Rational Completeness for First-Order Logics -- Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus -- Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics -- A Decidable Temporal Logic of Repeating Values -- Model Checking Knowledge and Linear Time: PSPACE Cases -- Realizations and LP -- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking -- Explicit Proofs in Formal Provability Logic -- A Synthesis Algorithm for Hybrid Systems -- Including the Past in ‘Topologic’ -- A Note on Rewriting Proofs and Fibonacci Numbers -- On Complexity of Ehrenfeucht-Fraïssé Games -- The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion -- Hypersequent Calculus for Intuitionistic Logic with Classical Atoms -- Proof Identity for Classical Logic: Generalizing to Normality -- On the Constructive Dedekind Reals: Extended Abstract -- Verifying Balanced Trees -- Compactness Properties for Stable Semantics of Logic Programs -- Uniform Circuits, & Boolean Proof Nets -- Finite Automata Presentable Abelian Groups -- Embeddings into Free Heyting Algebras and Translations into Intuitionistic PropositionalLogic -- Some Puzzles About Probability and Probabilistic Conditionals -- A Temporal Dynamic Logic for Verifying Hybrid System Invariants -- Multiplexor Categories and Models of Soft Linear Logic -- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms -- Total Public Announcements. |
| Record Nr. | UNINA-9910483206303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||