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.
Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky [[electronic resource] ] : Essays Dedicted to Samson Abramsky on the Occasion of His 60th Birthday / / edited by Bob Coecke, Luke Ong, Prakash Panangaden
| Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky [[electronic resource] ] : Essays Dedicted to Samson Abramsky on the Occasion of His 60th Birthday / / edited by Bob Coecke, Luke Ong, Prakash Panangaden |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XX, 363 p. 26 illus.) |
| Disciplina | 303.4833 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Software engineering Compilers (Computer programs) Computer Science Logic and Foundations of Programming Theory of Computation Formal Languages and Automata Theory Software Engineering Compilers and Interpreters |
| ISBN | 3-642-38164-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Use of a Canonical Hidden-Variable Space in Quantum Mechanics -- Imperfect Information in Logic and Concurrent Games -- Compositional Quantum Logic -- The Algebra of Directed Acyclic Graphs -- Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits -- Payoffs, Intensionality and Abstraction in Games -- On the Theory of Composition in Physics -- On the Functor 2 -- Quantum Speedup and Categorical Distributivity -- Unifying Semantics for Concurrent Programming -- Unfixing the Fixpoint: The Theories of the λY -Calculus -- Continuous Domain Theory in Logical Form -- Presheaf Models of Quantum Computation: An Outline -- Nothing Can Be Fixed -- Dialogue Categories and Frobenius Monoids -- Anatomy of a Domain of Continuous Random Variables II -- Towards Nominal Abramsky -- Techniques for Formal Modelling and Analysis of Quantum Systems -- Quantum Field Theory for Legspinners -- Bicompletions of Distance Matrices -- Partial Recursive Functions and Finality -- Breaking the Atom with Samson -- Reasoning about Strategies -- Domain Theory in Topical Form -- Kolmogorov Complexity of Categories. |
| Record Nr. | UNISA-996466181003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky : Essays Dedicted to Samson Abramsky on the Occasion of His 60th Birthday / / edited by Bob Coecke, Luke Ong, Prakash Panangaden
| Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky : Essays Dedicted to Samson Abramsky on the Occasion of His 60th Birthday / / edited by Bob Coecke, Luke Ong, Prakash Panangaden |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XX, 363 p. 26 illus.) |
| Disciplina | 303.4833 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Software engineering Compilers (Computer programs) Computer Science Logic and Foundations of Programming Theory of Computation Formal Languages and Automata Theory Software Engineering Compilers and Interpreters |
| ISBN | 3-642-38164-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Use of a Canonical Hidden-Variable Space in Quantum Mechanics -- Imperfect Information in Logic and Concurrent Games -- Compositional Quantum Logic -- The Algebra of Directed Acyclic Graphs -- Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits -- Payoffs, Intensionality and Abstraction in Games -- On the Theory of Composition in Physics -- On the Functor 2 -- Quantum Speedup and Categorical Distributivity -- Unifying Semantics for Concurrent Programming -- Unfixing the Fixpoint: The Theories of the λY -Calculus -- Continuous Domain Theory in Logical Form -- Presheaf Models of Quantum Computation: An Outline -- Nothing Can Be Fixed -- Dialogue Categories and Frobenius Monoids -- Anatomy of a Domain of Continuous Random Variables II -- Towards Nominal Abramsky -- Techniques for Formal Modelling and Analysis of Quantum Systems -- Quantum Field Theory for Legspinners -- Bicompletions of Distance Matrices -- Partial Recursive Functions and Finality -- Breaking the Atom with Samson -- Reasoning about Strategies -- Domain Theory in Topical Form -- Kolmogorov Complexity of Categories. |
| Record Nr. | UNINA-9910483887903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science Logic [[electronic resource] ] : 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings / / edited by Luke Ong
| Computer Science Logic [[electronic resource] ] : 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings / / edited by Luke Ong |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XI, 567 p.) |
| Disciplina | 005.1/015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Compilers (Computer programs)
Computer science Machine theory Artificial intelligence Mathematical logic Compilers and Interpreters Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Artificial Intelligence Mathematical Logic and Foundations |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- XML Navigation and Tarski’s Relation Algebras -- Verification in Predicate Logic with Time: Algorithmic Questions -- Note on Formal Analogical Reasoning in the Juridical Context -- An Abstract Strong Normalization Theorem -- Semantics and Logics -- On Bunched Polymorphism -- Distributed Control Flow with Classical Modal Logic -- A Logic of Coequations -- A Semantic Formulation of ???-Lifting and Logical Predicates for Computational Metalanguage -- Type Theory and Lambda Calculus -- Order Structures on Böhm-Like Models -- Higher-Order Matching and Games -- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations -- On the Role of Type Decorations in the Calculus of Inductive Constructions -- Linear Logic and Ludics -- L-Nets, Strategies and Proof-Nets -- Permutative Logic -- Focusing the Inverse Method for Linear Logic -- Towards a Typed Geometry of Interaction -- Constraints -- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction -- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints -- Finite Models, Decidability and Complexity -- Coprimality in Finite Models -- Towards a Characterization of Order-Invariant Queries over Tame Structures -- Decidability of Term Algebras Extending Partial Algebras -- Results on the Guarded Fragment with Equivalence or Transitive Relations -- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic -- On the Complexity of Hybrid Logics with Binders -- The Complexity of Independence-Friendly Fixpoint Logic -- Closure Properties of Weak Systems of Bounded Arithmetic -- Verification and Model Checking -- Transfinite Extension of the Mu-Calculus -- Bounded Model Checking of Pointer Programs -- PDL with Intersection and Converse Is Decidable -- On Deciding Topological Classes of Deterministic Tree Languages -- Constructive Reasoning and Computational Mathematics -- Complexity and Intensionality in a Type-1 Framework for Computable Analysis -- Computing with Sequences, Weak Topologies and the Axiom of Choice -- Light Functional Interpretation -- Feasible Proofs of Matrix Properties with Csanky’s Algorithm -- Implicit Computational Complexity and Rewriting -- A Propositional Proof System for Log Space -- Identifying Polynomial-Time Recursive Functions -- Confluence of Shallow Right-Linear Rewrite Systems -- Appendices -- The Ackermann Award 2005 -- Clemens Lautemann: 1951-2005 An Obituary. |
| Record Nr. | UNISA-996465924403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer science logic : 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 : proceedings / / Luke Ong (ed.)
| Computer science logic : 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 : proceedings / / Luke Ong (ed.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2005 |
| Descrizione fisica | 1 online resource (XI, 567 p.) |
| Disciplina | 005.1/015113 |
| Altri autori (Persone) | OngLuke |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computer logic |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- XML Navigation and Tarski’s Relation Algebras -- Verification in Predicate Logic with Time: Algorithmic Questions -- Note on Formal Analogical Reasoning in the Juridical Context -- An Abstract Strong Normalization Theorem -- Semantics and Logics -- On Bunched Polymorphism -- Distributed Control Flow with Classical Modal Logic -- A Logic of Coequations -- A Semantic Formulation of ???-Lifting and Logical Predicates for Computational Metalanguage -- Type Theory and Lambda Calculus -- Order Structures on Böhm-Like Models -- Higher-Order Matching and Games -- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations -- On the Role of Type Decorations in the Calculus of Inductive Constructions -- Linear Logic and Ludics -- L-Nets, Strategies and Proof-Nets -- Permutative Logic -- Focusing the Inverse Method for Linear Logic -- Towards a Typed Geometry of Interaction -- Constraints -- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction -- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints -- Finite Models, Decidability and Complexity -- Coprimality in Finite Models -- Towards a Characterization of Order-Invariant Queries over Tame Structures -- Decidability of Term Algebras Extending Partial Algebras -- Results on the Guarded Fragment with Equivalence or Transitive Relations -- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic -- On the Complexity of Hybrid Logics with Binders -- The Complexity of Independence-Friendly Fixpoint Logic -- Closure Properties of Weak Systems of Bounded Arithmetic -- Verification and Model Checking -- Transfinite Extension of the Mu-Calculus -- Bounded Model Checking of Pointer Programs -- PDL with Intersection and Converse Is Decidable -- On Deciding Topological Classes of Deterministic Tree Languages -- Constructive Reasoning and Computational Mathematics -- Complexity and Intensionality in a Type-1 Framework for Computable Analysis -- Computing with Sequences, Weak Topologies and the Axiom of Choice -- Light Functional Interpretation -- Feasible Proofs of Matrix Properties with Csanky’s Algorithm -- Implicit Computational Complexity and Rewriting -- A Propositional Proof System for Log Space -- Identifying Polynomial-Time Recursive Functions -- Confluence of Shallow Right-Linear Rewrite Systems -- Appendices -- The Ackermann Award 2005 -- Clemens Lautemann: 1951-2005 An Obituary. |
| Altri titoli varianti |
CSL 2005
14th Annual Conference of the EACSL Fourteenth Annual Conference of the EACSL Conference of the EACSL |
| Record Nr. | UNINA-9910484744203321 |
| Berlin, : Springer, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Formal Methods and Software Engineering [[electronic resource] ] : 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings / / edited by Zhenhua Duan, Luke Ong
| Formal Methods and Software Engineering [[electronic resource] ] : 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings / / edited by Zhenhua Duan, Luke Ong |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVII, 498 p. 134 illus.) |
| Disciplina | 005.1 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer programming Programming languages (Electronic computers) Computer logic Mathematical logic Computer communication systems Software Engineering Programming Techniques Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Computer Communication Networks |
| ISBN | 3-319-68690-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Verification and validation -- Software engineering -- Formal specification and modeling -- Software security -- Software reliability. |
| Record Nr. | UNISA-996465302403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal Methods and Software Engineering : 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings / / edited by Zhenhua Duan, Luke Ong
| Formal Methods and Software Engineering : 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings / / edited by Zhenhua Duan, Luke Ong |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVII, 498 p. 134 illus.) |
| Disciplina | 005.1 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer programming Programming languages (Electronic computers) Computer logic Mathematical logic Computer communication systems Software Engineering Programming Techniques Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Computer Communication Networks |
| ISBN | 3-319-68690-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Verification and validation -- Software engineering -- Formal specification and modeling -- Software security -- Software reliability. |
| Record Nr. | UNINA-9910483861403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Software Science and Computational Structures [[electronic resource] ] : 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010, Proceedings / / edited by Luke Ong
| Foundations of Software Science and Computational Structures [[electronic resource] ] : 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010, Proceedings / / edited by Luke Ong |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XV, 389 p. 47 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Compilers (Computer programs) Software engineering Computer science Formal Languages and Automata Theory Compilers and Interpreters Software Engineering Theory of Computation Computer Science Logic and Foundations of Programming |
| ISBN |
1-280-38588-X
9786613563804 3-642-12032-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | FoSSaCS 2010 Invited Talk -- to Decidability of Higher-Order Matching -- Semantics of Programming Languages -- A Semantic Foundation for Hidden State -- Linearly-Used Continuations in the Enriched Effect Calculus -- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience -- Completeness for Algebraic Theories of Local State -- Probabilistic and Randomised Computation -- Fair Adversaries and Randomization in Two-Player Games -- Retaining the Probabilities in Probabilistic Testing Theory -- Concurrency and Process Theory -- Forward Analysis of Depth-Bounded Processes -- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization -- Parameterised Multiparty Session Types -- On the Relationship between Spatial Logics and Behavioral Simulations -- Modal and Temporal Logics -- An Easy Completeness Proof for the Modal ?-Calculus on Finite Trees -- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable -- Model Checking Is Static Analysis of Modal Logic -- Counting CTL -- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems -- Verification -- Toward a Compositional Theory of Leftist Grammars and Transformations -- Degrees of Lookahead in Regular Infinite Games -- Reachability Analysis of Communicating Pushdown Systems -- The Complexity of Synchronous Notions of Information Flow Security -- Categorical and Coalgebraic Methods -- Monads Need Not Be Endofunctors -- CIA Structures and the Semantics of Recursion -- Coalgebraic Correspondence Theory -- Lambda Calculus and Types -- Untyped Recursion Schemes and Infinite Intersection Types -- Solvability in Resource Lambda-Calculus -- A Hierarchy for Delimited Continuations in Call-by-Name. |
| Record Nr. | UNISA-996465327403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of software science and computational structures : 13th International Conference, FOSSACS 2010, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 22-28, 2010 : proceedings / / Luke Ong (ed.)
| Foundations of software science and computational structures : 13th International Conference, FOSSACS 2010, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 22-28, 2010 : proceedings / / Luke Ong (ed.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer, c2010 |
| Descrizione fisica | 1 online resource (XV, 389 p. 47 illus.) |
| Disciplina | 005.131 |
| Altri autori (Persone) | OngLuke |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
System analysis
Computer software |
| ISBN |
1-280-38588-X
9786613563804 3-642-12032-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | FoSSaCS 2010 Invited Talk -- to Decidability of Higher-Order Matching -- Semantics of Programming Languages -- A Semantic Foundation for Hidden State -- Linearly-Used Continuations in the Enriched Effect Calculus -- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience -- Completeness for Algebraic Theories of Local State -- Probabilistic and Randomised Computation -- Fair Adversaries and Randomization in Two-Player Games -- Retaining the Probabilities in Probabilistic Testing Theory -- Concurrency and Process Theory -- Forward Analysis of Depth-Bounded Processes -- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization -- Parameterised Multiparty Session Types -- On the Relationship between Spatial Logics and Behavioral Simulations -- Modal and Temporal Logics -- An Easy Completeness Proof for the Modal ?-Calculus on Finite Trees -- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable -- Model Checking Is Static Analysis of Modal Logic -- Counting CTL -- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems -- Verification -- Toward a Compositional Theory of Leftist Grammars and Transformations -- Degrees of Lookahead in Regular Infinite Games -- Reachability Analysis of Communicating Pushdown Systems -- The Complexity of Synchronous Notions of Information Flow Security -- Categorical and Coalgebraic Methods -- Monads Need Not Be Endofunctors -- CIA Structures and the Semantics of Recursion -- Coalgebraic Correspondence Theory -- Lambda Calculus and Types -- Untyped Recursion Schemes and Infinite Intersection Types -- Solvability in Resource Lambda-Calculus -- A Hierarchy for Delimited Continuations in Call-by-Name. |
| Altri titoli varianti |
ETAPS 2010
FOSSACS 2010 |
| Record Nr. | UNINA-9910483822903321 |
| Berlin ; ; Heidelberg, : Springer, c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic, Language, Information, and Computation [[electronic resource] /] / edited by Luke Ong, Ruy de Queiroz
| Logic, Language, Information, and Computation [[electronic resource] /] / edited by Luke Ong, Ruy de Queiroz |
| Edizione | [2nd ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XII, 337 p. 49 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Machine theory Computer science—Mathematics Discrete mathematics Computer science Formal Languages and Automata Theory Discrete Mathematics in Computer Science Computer Science Logic and Foundations of Programming Theory of Computation Symbolic and Algebraic Manipulation |
| ISBN | 3-642-32621-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465744103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Typed Lambda Calculi and Applications [[electronic resource] ] : 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings / / edited by Luke Ong
| Typed Lambda Calculi and Applications [[electronic resource] ] : 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings / / edited by Luke Ong |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XII, 245 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science—Mathematics Computer science Artificial intelligence Mathematical logic Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Symbolic and Algebraic Manipulation Artificial Intelligence Mathematical Logic and Foundations |
| ISBN | 3-642-21691-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465539003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||