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 | ||
| ||
Languages: From Formal to Natural [[electronic resource] ] : Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday / / edited by Orna Grumberg, Michael Kaminski, Shmuel Katz, Shuly Wintner
| Languages: From Formal to Natural [[electronic resource] ] : Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday / / edited by Orna Grumberg, Michael Kaminski, Shmuel Katz, Shuly Wintner |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 245 p.) |
| Disciplina | 005.131 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Mathematical logic
Computer logic Computers Arithmetic and logic units, Computer Mathematical Logic and Formal Languages Mathematical Logic and Foundations Logics and Meanings of Programs Theory of Computation Arithmetic and Logic Structures |
| ISBN | 3-642-01748-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Languages: From Formal to Natural -- Modular Verification of Recursive Programs -- Semi-formal Evaluation of Conversational Characters -- Scope Dominance with Generalized Quantifiers -- Nonassociative Lambek Calculus with Additives and Context-Free Languages -- On Lazy Commutation -- Aspect Oriented Approach for Capturing and Verifying Distributed Properties -- No i-Sums for Nissim (and Shalom) -- The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata -- Modular Verification of Strongly Invasive Aspects -- Classes of Service under Perfect Competition and Technological Change -- On the Ontological Nature of Syntactic Categories in Categorial Grammar -- Masking Gateway for Enterprises -- No Syllogisms for the Numerical Syllogistic -- Formal Grammars of Early Language -- Hybrid BDD and All-SAT Method for Model Checking. |
| Record Nr. | UNISA-996466264503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Languages: From Formal to Natural : Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday / / edited by Orna Grumberg, Michael Kaminski, Shmuel Katz, Shuly Wintner
| Languages: From Formal to Natural : Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday / / edited by Orna Grumberg, Michael Kaminski, Shmuel Katz, Shuly Wintner |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 245 p.) |
| Disciplina | 005.131 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Mathematical logic
Computer logic Computers Arithmetic and logic units, Computer Mathematical Logic and Formal Languages Mathematical Logic and Foundations Logics and Meanings of Programs Theory of Computation Arithmetic and Logic Structures |
| ISBN | 3-642-01748-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Languages: From Formal to Natural -- Modular Verification of Recursive Programs -- Semi-formal Evaluation of Conversational Characters -- Scope Dominance with Generalized Quantifiers -- Nonassociative Lambek Calculus with Additives and Context-Free Languages -- On Lazy Commutation -- Aspect Oriented Approach for Capturing and Verifying Distributed Properties -- No i-Sums for Nissim (and Shalom) -- The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata -- Modular Verification of Strongly Invasive Aspects -- Classes of Service under Perfect Competition and Technological Change -- On the Ontological Nature of Syntactic Categories in Categorial Grammar -- Masking Gateway for Enterprises -- No Syllogisms for the Numerical Syllogistic -- Formal Grammars of Early Language -- Hybrid BDD and All-SAT Method for Model Checking. |
| Record Nr. | UNINA-9910484476103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||