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.
Logic and Computational Complexity [[electronic resource] ] : International Workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers / / edited by Daniel Leivant
| Logic and Computational Complexity [[electronic resource] ] : International Workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers / / edited by Daniel Leivant |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (VIII, 520 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Computers Algorithms Mathematical logic Mathematics of Computing Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Mathematical Logic and Foundations |
| ISBN | 3-540-44720-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Strict finitism and feasibility -- Logical omniscience -- On feasible numbers -- On parallel hierarchies and R k i -- Program extraction from classical proofs -- Computation models and function algebras -- Expressing computational complexity in constructive type theory -- Light linear logic -- Intrinsic theories and computational complexity -- On Herbrand's theorem -- Some consequences of cryptographical conjectures for S 2 1 and EF -- Frege proof system and TNC° -- Characterizing parallel time by type 2 recursions with polynomial output length -- Type 2 polynomial hierarchies -- The hierarchy of terminating recursive programs over N -- Feasibly categorical models -- Metafinite model theory -- Automatic presentations of structures -- A restricted second order logic for finite structures -- Comparing the power of monadic NP games -- Linear constraint query languages expressive power and complexity -- A constant-space sequential model of computation for first-order logic -- Logics capturing relativized complexity classes uniformly -- Preservation theorems in finite model theory -- A query language for NC (extended abstract). |
| Record Nr. | UNISA-996466136703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language, Information, and Computation [[electronic resource] ] : 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings / / edited by Valeria de Paiva, Ruy de Queiroz, Lawrence S. Moss, Daniel Leivant, Anjolina G. de Oliveira
| Logic, Language, Information, and Computation [[electronic resource] ] : 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings / / edited by Valeria de Paiva, Ruy de Queiroz, Lawrence S. Moss, Daniel Leivant, Anjolina G. de Oliveira |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XX, 201 p. 14 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer science—Mathematics Algorithms Formal Languages and Automata Theory Artificial Intelligence Symbolic and Algebraic Manipulation |
| ISBN | 3-662-47709-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modeling Language Design for Complex Systems Simulation -- Formalization of Mathematics for Fun and Profit -- From Residuated Lattices via GBI-algebras to BAOs -- Towards a Nominal Chomsky Hierarchy -- Multi-Linear Algebraic Semantics for Natural Language -- Categories of Games -- Learning in the limit, general topology, and modal logic -- The Word Problem for Finitely Presented Quandles is Undecidable -- Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language -- On Topologically Relevant Fragments of the Logic of Linear Flows of Time -- An Equation-Based Classical Logic -- Cyclic multiplicative proof nets of linear logic with an application to language parsing -- A Dichotomy Result for Ramsey Quantifiers -- Parametric Polymorphism { Universally -- On the weak index problem for game automata -- Proof-theoretic aspects of the Lambek-Grishin Calculus -- Syllogistic Logic with "Most" -- Characterizing Frame Definability in Team Semantics via The Universal Modality -- An Epistemic Separation Logic -- Equational properties of stratified least fixed points -- The p-adic integers as final coalgebra. |
| Record Nr. | UNISA-996216374003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language, Information, and Computation [[electronic resource] ] : 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings / / edited by Valeria de Paiva, Ruy de Queiroz, Lawrence S. Moss, Daniel Leivant, Anjolina G. de Oliveira
| Logic, Language, Information, and Computation [[electronic resource] ] : 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings / / edited by Valeria de Paiva, Ruy de Queiroz, Lawrence S. Moss, Daniel Leivant, Anjolina G. de Oliveira |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XX, 201 p. 14 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer science—Mathematics Algorithms Formal Languages and Automata Theory Artificial Intelligence Symbolic and Algebraic Manipulation |
| ISBN | 3-662-47709-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modeling Language Design for Complex Systems Simulation -- Formalization of Mathematics for Fun and Profit -- From Residuated Lattices via GBI-algebras to BAOs -- Towards a Nominal Chomsky Hierarchy -- Multi-Linear Algebraic Semantics for Natural Language -- Categories of Games -- Learning in the limit, general topology, and modal logic -- The Word Problem for Finitely Presented Quandles is Undecidable -- Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language -- On Topologically Relevant Fragments of the Logic of Linear Flows of Time -- An Equation-Based Classical Logic -- Cyclic multiplicative proof nets of linear logic with an application to language parsing -- A Dichotomy Result for Ramsey Quantifiers -- Parametric Polymorphism { Universally -- On the weak index problem for game automata -- Proof-theoretic aspects of the Lambek-Grishin Calculus -- Syllogistic Logic with "Most" -- Characterizing Frame Definability in Team Semantics via The Universal Modality -- An Epistemic Separation Logic -- Equational properties of stratified least fixed points -- The p-adic integers as final coalgebra. |
| Record Nr. | UNINA-9910484234003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||