Computer Science Logic [[electronic resource] ] : 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter |
Edizione | [1st ed. 1993.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
Descrizione fisica | 1 online resource (IX, 439 p.) |
Disciplina | 004/.01/5113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Software engineering Mathematical logic Computer logic Algorithms Theory of Computation Software Engineering/Programming and Operating Systems Mathematical Logic and Foundations Logics and Meanings of Programs Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
ISBN | 3-540-47890-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A universal Turing machine -- Recursive inseparability in linear logic -- The basic logic of proofs -- Algorithmic structuring of cut-free proofs -- Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions -- Linear ?-calculus and categorical models revisited -- A self-interpreter of lambda calculus having a normal form -- An “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic -- The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness -- Model building by resolution -- Comparative transition system semantics -- Reasoning with higher order partial functions -- Communicating evolving algebras -- On the completeness of narrowing as the operational semantics of functional logic programming -- Inductive definability with counting on finite structures -- Linear time algorithms and NP-complete problems -- The semantics of the C programming language -- A theory of classes for a functional language with effects -- Logical definability of NP-optimisation problems with monadic auxiliary predicates -- Universes in the theories of types and names -- Notes on sconing and relators -- Solving 3-satisfiability in less than 1, 579n steps -- Kleene's slash and existence of values of open terms in type theory -- Negation-complete logic programs -- Logical characterization of bounded query classes II: Polynomial-time oracle machines -- On asymptotic probabilities of monadic second order properties. |
Record Nr. | UNISA-996466156403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computer Science Logic [[electronic resource] ] : 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter |
Edizione | [1st ed. 1992.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
Descrizione fisica | 1 online resource (VIII, 431 p.) |
Disciplina | 004.0151 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Mathematical logic Computer logic Algorithms Theory of Computation Mathematical Logic and Foundations Logics and Meanings of Programs Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
ISBN | 3-540-47285-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The expressive power of transitive closure and 2-way multihead automata -- Correctness proof for the WAM with types -- Model checking of persistent Petri nets -- Provability in TBLL: A decision procedure -- How to implement first order formulas in local memory machine models -- A new approach to abstract data types II computation on ADTs as ordinary computation -- A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation -- On bounded theories -- The cutting plane proof system with bounded degree of falsity -- Denotational versus declarative semantics for functional programming -- On transitive closure logic -- Some aspects of the probabilistic behavior of variants of resolution -- Safe queries in relational databases with functions -- Logical inference and polyhedral projection -- Stable logic -- A transformational methodology for proving termination of logic programs -- Plausibility logic -- Towards Kleene Algebra with recursion -- Equational specification of abstract types and combinators -- Normal forms in infinite-valued logic: The case of one variable -- A fragment of first order logic adequate for observation equivalence -- Ordinal processes in comparative concurrency semantics -- Logical semantics of modularisation -- A cut-elimination procedure designed for evaluating proofs as programs -- Minimal from classical proofs -- Quantifier hierarchies over word relations -- Complexity results for the default- and the autoepistemic logic -- On Completeness for NP via projection translations -- Control of ?-automata, Church's problem, and the emptiness problem for tree ?-automata -- Comparing the theory of representations and constructive mathematics -- Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic -- On completeness of program synthesis systems -- Proving termination for term rewriting systems. |
Record Nr. | UNISA-996465475103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Feferman on Foundations : Logic, Mathematics, Philosophy / / edited by Gerhard Jäger, Wilfried Sieg |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (lxxx, 551 pages) : illustrations |
Disciplina | 511.3 |
Collana | Outstanding Contributions to Logic |
Soggetto topico |
Mathematical logic
Logic Mathematical Logic and Foundations Mathematical Logic and Formal Languages |
ISBN | 3-319-63334-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Tentative TOC Table of contents Introduction: Perspective Feferman: Autobiography I. Mathematical Logic -- Model Theory -- Set Theory -- Proof Theory. - Computability Theory II. Conceptual Expansions . Predicativity -- Unfolding 2 -- Semi-constructive systems III. Axiomatic Foundations -- Explicit Mathematics and Operational Set Theory -- Theories of Truth -- Foundations of Category Theory IV. From Logic to Philosophy -- What is Logic? -- Foundational Ways -- Gödel, Minds and Machines -- New Axioms and the Continuum Problem -- Conceptual Structuralism V. Responses Feferman: Bibliography Contributors: Short biographies -- Index. . |
Record Nr. | UNINA-9910279756103321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Language, Games, and Evolution [[electronic resource] ] : Trends in Current Research on Language and Game Theory / / edited by Anton Benz, Christian Ebert, Gerhard Jäger, Robert van Rooij |
Edizione | [1st ed. 2011.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
Descrizione fisica | 1 online resource (VII, 189 p. 21 illus., 1 illus. in color.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Algorithms Computers Computer science—Mathematics Mathematical logic Artificial Intelligence Algorithm Analysis and Problem Complexity Computation by Abstract Devices Discrete Mathematics in Computer Science Mathematical Logic and Formal Languages |
ISBN | 3-642-18006-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | pt. 1. Non-evolutionary approaches : synchronic phenomena -- pt. 2. Evolutionary approaches : diachronic phenomena. |
Record Nr. | UNISA-996465926003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
The Mathematics of Language [[electronic resource] ] : 10th and 11th Biennial Conference, MOL 10, Los Angeles, CA, USA, July 28-30, 2007 and MOL 11, Bielefeld, Germany, August 20-21, 2009, Revised Selected Papers / / edited by Christian Ebert, Gerhard Jäger, Jens Michaelis |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (VIII, 297 p. 55 illus.) |
Disciplina | 410.1/51 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Compilers (Computer programs)
Computer programming Computer science Machine theory Computer science—Mathematics Discrete mathematics Compilers and Interpreters Programming Techniques Theory of Computation Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science |
ISBN | 3-642-14322-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Dependency Structures Derived from Minimalist Grammars -- Deforesting Logical Form -- On the Probability Distribution of Typological Frequencies -- A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus -- LC Graphs for the Lambek Calculus with Product -- Proof-Theoretic Semantics for a Natural Language Fragment -- Some Interdefinability Results for Syntactic Constraint Classes -- Sortal Equivalence of Bare Grammars -- Deriving Syntactic Properties of Arguments and Adjuncts from Neo-Davidsonian Semantics -- On Monadic Second-Order Theories of Multidominance Structures -- The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars -- A Formal Foundation for A and A-bar Movement -- Without Remnant Movement, MGs Are Context-Free -- The Algebra of Lexical Semantics -- Phonological Interpretation into Preordered Algebras -- Relational Semantics for the Lambek-Grishin Calculus -- Intersecting Adjectives in Syllogistic Logic -- Creation Myths of Generative Grammar and the Mathematics of Syntactic Structures -- On Languages Piecewise Testable in the Strict Sense -- A Note on the Complexity of Abstract Categorial Grammars -- Almost All Complex Quantifiers Are Simple -- Constituent Structure Sets I. |
Record Nr. | UNISA-996466432203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
The Mathematics of Language : 10th and 11th Biennial Conference, MOL 10, Los Angeles, CA, USA, July 28-30, 2007 and MOL 11, Bielefeld, Germany, August 20-21, 2009, Revised Selected Papers / / edited by Christian Ebert, Gerhard Jäger, Jens Michaelis |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (VIII, 297 p. 55 illus.) |
Disciplina | 410.1/51 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Compilers (Computer programs)
Computer programming Computer science Machine theory Computer science—Mathematics Discrete mathematics Compilers and Interpreters Programming Techniques Theory of Computation Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science |
ISBN | 3-642-14322-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Dependency Structures Derived from Minimalist Grammars -- Deforesting Logical Form -- On the Probability Distribution of Typological Frequencies -- A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus -- LC Graphs for the Lambek Calculus with Product -- Proof-Theoretic Semantics for a Natural Language Fragment -- Some Interdefinability Results for Syntactic Constraint Classes -- Sortal Equivalence of Bare Grammars -- Deriving Syntactic Properties of Arguments and Adjuncts from Neo-Davidsonian Semantics -- On Monadic Second-Order Theories of Multidominance Structures -- The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars -- A Formal Foundation for A and A-bar Movement -- Without Remnant Movement, MGs Are Context-Free -- The Algebra of Lexical Semantics -- Phonological Interpretation into Preordered Algebras -- Relational Semantics for the Lambek-Grishin Calculus -- Intersecting Adjectives in Syllogistic Logic -- Creation Myths of Generative Grammar and the Mathematics of Syntactic Structures -- On Languages Piecewise Testable in the Strict Sense -- A Note on the Complexity of Abstract Categorial Grammars -- Almost All Complex Quantifiers Are Simple -- Constituent Structure Sets I. |
Record Nr. | UNINA-9910484492303321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Theory and Applications of Models of Computation [[electronic resource] ] : 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings / / edited by T.V. Gopal, Gerhard Jäger, Silvia Steila |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XXVI, 698 p. 80 illus.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Machine theory
Computer science—Mathematics Algorithms Computer science Data structures (Computer science) Information theory Artificial intelligence Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory Artificial Intelligence |
ISBN | 3-319-55911-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Computability -- Computer science logic -- Complexity -- Algorithms -- Models of computation and systems theory. |
Record Nr. | UNISA-996466201503316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Theory and Applications of Models of Computation : 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings / / edited by T.V. Gopal, Gerhard Jäger, Silvia Steila |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XXVI, 698 p. 80 illus.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Machine theory
Computer science—Mathematics Algorithms Computer science Data structures (Computer science) Information theory Artificial intelligence Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory Artificial Intelligence |
ISBN | 3-319-55911-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Computability -- Computer science logic -- Complexity -- Algorithms -- Models of computation and systems theory. |
Record Nr. | UNINA-9910484777803321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|