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.
Computer Science Logic [[electronic resource] ] : 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings / / edited by Michael Kaminski, Simone Martini
| Computer Science Logic [[electronic resource] ] : 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings / / edited by Michael Kaminski, Simone Martini |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XI, 513 p.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence Mathematical logic Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Mathematical Logic and Foundations |
| ISBN | 3-540-87531-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- The Computability Path Ordering: The End of a Quest -- The Joy of String Diagrams -- Model Transformations in Decidability Proofs for Monadic Theories -- Molecules as Automata -- Contributed Papers -- An Infinite Automaton Characterization of Double Exponential Time -- Recursion Schemata for NC k -- Extensional Uniformity for Boolean Circuits -- Pure Pointer Programs with Iteration -- Quantified Positive Temporal Constraints -- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint -- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars -- Continuous Fragment of the mu-Calculus -- On the Relations between the Syntactic Theories of ??-Calculi -- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms -- Proving Infinitude of Prime Numbers Using Binomial Coefficients -- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic -- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) -- Quantitative Game Semantics for Linear Logic -- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic -- An Indexed System for Multiplicative Additive Polarized Linear Logic -- A Characterisation of Lambda Definability with Sums Via ???-Closure Operators -- Superposition for Fixed Domains -- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T -- On the Almighty Wand -- On Counting Generalized Colorings -- The Descriptive Complexity of Parity Games -- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games -- Quantitative Languages -- Characterization of Logics over Ranked Tree Languages -- The Nesting-Depth of Disjunctive ?-Calculus for Tree Languages and the Limitedness Problem -- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) -- Syntactic Metatheory of Higher-Order Subtyping -- On Isomorphisms of Intersection Types -- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence -- Type-Based Termination with Sized Products -- The Ackermann Session -- The Ackermann Award 2008. |
| Record Nr. | UNISA-996466106203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic : 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings / / edited by Michael Kaminski, Simone Martini
| Computer Science Logic : 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings / / edited by Michael Kaminski, Simone Martini |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XI, 513 p.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence Mathematical logic Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Mathematical Logic and Foundations |
| ISBN | 3-540-87531-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- The Computability Path Ordering: The End of a Quest -- The Joy of String Diagrams -- Model Transformations in Decidability Proofs for Monadic Theories -- Molecules as Automata -- Contributed Papers -- An Infinite Automaton Characterization of Double Exponential Time -- Recursion Schemata for NC k -- Extensional Uniformity for Boolean Circuits -- Pure Pointer Programs with Iteration -- Quantified Positive Temporal Constraints -- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint -- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars -- Continuous Fragment of the mu-Calculus -- On the Relations between the Syntactic Theories of ??-Calculi -- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms -- Proving Infinitude of Prime Numbers Using Binomial Coefficients -- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic -- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) -- Quantitative Game Semantics for Linear Logic -- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic -- An Indexed System for Multiplicative Additive Polarized Linear Logic -- A Characterisation of Lambda Definability with Sums Via ???-Closure Operators -- Superposition for Fixed Domains -- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T -- On the Almighty Wand -- On Counting Generalized Colorings -- The Descriptive Complexity of Parity Games -- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games -- Quantitative Languages -- Characterization of Logics over Ranked Tree Languages -- The Nesting-Depth of Disjunctive ?-Calculus for Tree Languages and the Limitedness Problem -- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) -- Syntactic Metatheory of Higher-Order Subtyping -- On Isomorphisms of Intersection Types -- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence -- Type-Based Termination with Sized Products -- The Ackermann Session -- The Ackermann Award 2008. |
| Record Nr. | UNINA-9910484232903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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
| 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 | ||
| ||