Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	August 2001
Genre:	EDV / Informatik
	Artificial Intelligence / C / Compilers & interpreters / Compilers and Interpreters / Computer architecture & logic design / Computer logic / Computer programming / software engineering / computer science / Computer Science Logic and Foundations of Programming / Formal Languages and Automata Theory / Logics and Meanings of Programs / Mathematical foundations / Mathematical logic / Mathematical Logic and Formal Languages / Mathematical Logic and Foundations / Mathematical theory of computation / Programming languages (Electronic computers) / Programming Languages, Compilers, Interpreters mehr...
ISBN:	9783540425540
EAN-Code:	9783540425540
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#2142 - Lecture Notes in Computer Science
Dimensionen:	H 233 mm / B 155 mm / D
Gewicht:	1930 gr
Seiten:	628
Illustration:	XII, 628 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Invited Papers.- Local Reasoning about Programs that Alter Data Structures.- Applications of Alfred Tarski's Ideas in Database Theory.- Locus Solum: From the Rules of Logic to the Logic of Rules.- Contributed Papers.- The Expressive Power of Horn Monadic Linear Logic.- Non-commutativity and MELL in the Calculus of Structures.- Quadratic Correctness Criterion for Non-commutative Logic.- Descriptive Complexity.- Capture Complexity by Partition.- An Existential Locality Theorem.- Actual Arithmetic and Feasibility.- The Natural Order-Generic Collapse for ?-Representable Databases over the Rational and the Real Ordered Group.- Semantics.- An Algebraic Foundation for Higraphs.- Semantic Characterisations of Second-Order Computability over the Real Numbers.- An Abstract Look at Realizability.- The Anatomy of Innocence.- Higher-Order Programs.- An Improved Extensionality Criterion for Higher-Order Logic Programs.- A Logic for Abstract State Machines.- Constrained Hyper Tableaux.- Modal Logics.- Modal Logic and the Two-Variable Fragment.- A Logic for Approximate First-Order Reasoning.- Inflationary Fixed Points in Modal Logic.- Categorical and Kripke Semantics for Constructive S4 Modal Logic.- Verification.- Labelled Natural Deduction for Interval Logics.- Decidable Navigation Logics for Object Structures.- The Decidability of Model Checking Mobile Ambients.- Automata.- A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem.- An Effective Extension of the Wagner Hierarchy to Blind Counter Automata.- Decision Procedure for an Extension of WS1S.- Lambda-Calculus.- Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic.- Intersection Logic.- Life without the Terminal Type.- Fully Complete Minimal PER Models for the Simply Typed?-Calculus.- Induction.- A Principle of Induction.- On a Generalisation of Herbrand's Theorem.- Well-Founded Recursive Relations.- Equational Calculus.- Stratified Context Unification Is in PSPACE.- Uniform Derivation of Decision Procedures by Superposition.- Complete Categorical Equational Deduction.- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.- Constructive Theory of Types.- Normalized Types.- Markov's Principle for Propositional Type Theory.- Recursion for Higher-Order Encodings.- Monotone Inductive and Coinductive Constructors of Rank 2.