scientific article; zbMATH DE number 612169

Wolfgang Thomas, Jörg Flum, Heinz-Dieter Ebbinghaus

Publication date: 31 July 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

sequent calculus decidability semantics completeness theorem elementary equivalence syntax compactness theorem Herbrand's theorem Gödel's incompleteness theorems free models first-order logic and its extensions Lindström's theorems Löwenheim- Skolem theorem

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical first-order logic (03B10) General logic (03B99) Basic properties of first-order languages and structures (03C07)

Related Items

Bounded quantifier depth spectra for random graphs, Trees, grids, and MSO decidability: from graphs to matroids, Learning elementary formal systems with queries., Refuting learning revisited., A note on the size of prenex normal forms, On the logic of theory change: Partial meet contraction and revision functions, Describing parameterized complexity classes, On the complexity of decision using destinies in $H$-bounded structures, The sound and complete R-calculus for revising propositional theories, Concise finite-domain representations for PDDL planning tasks, The complexity of first-order and monadic second-order logic revisited, Modal and guarded characterisation theorems over finite transition systems, Complexity of counting the optimal solutions, Computing crossing numbers in quadratic time, Tableaux for free logics with descriptions, Changing a Semantics: Opportunism or Courage?, Simplifying proofs in Fitch-style natural deduction systems, On the zero-one $k$-law extensions, Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth, A double arity hierarchy theorem for transitive closure logic, Formalization of the resolution calculus for first-order logic, A first order theory of functional parthood, On the existence of free models in fuzzy universal Horn classes, Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle, A representation theorem for ($q$-)holonomic sequences, A logical expression of reasoning, Logics of Finite Hankel Rank, Games and Lindström theorems, Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem, Parameterised counting in logspace, Are there any good digraph width measures?, Spectra and satisfiability for logics with successor and a unary function, Zero-one $k$-law, \textsf{LOGIC}: a Coq library for logics, Universally defining Z$\mathbb {Z}$ in Q$\mathbb {Q}$ with 10 quantifiers, Generalizing empirical adequacy. II: Partial structures, A decidability result for the model checking of infinite-state systems, Foundations and Philosophy of Mathematics in Warsaw, the School of Andrzej Mostowski and Philosophy, Deciding quantifier-free definability in finite algebraic structures, Second-order propositional modal logic and monadic alternation hierarchies, Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words, Recursive definitions and fixed-points on well-founded structures, Incompleteness Theorems, Large Cardinals, and Automata over Finite Words, Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract), Logics of relative identity, Polynomial hierarchy graph properties in hybrid logic, Second-order propositional modal logic: expressiveness and completeness results, Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic, Monadic partition logics and finite automata, The descriptive complexity of decision problems through logics with relational fixed-point and capturing results, Fine hierarchies and m-reducibilities in theoretical computer science, Proof verification and proof discovery for relativity, The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself, Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus, On bracketing names and quantifiers in first-order logic, Scientific discovery on positive data via belief revision, Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs, Ehrenfeucht-Fraïssé goes automatic for real addition, The descriptive complexity approach to LOGCFL, A model-theoretic characterization of constant-depth arithmetic circuits, Some results concerning simple locally finite groups of 1-type., Commentary and Illocutionary Expressions in Linear Calculi of Natural Deduction, Is Universal Computation a Myth?, Boolean products of real closed valuation rings and fields, Decidable ${\exists}^*{\forall}^*$ first-order fragments of linear rational arithmetic with uninterpreted predicates, On the parameterized complexity of $[1,j$-domination problems], Conjunctive query pattern structures: a relational database model for formal concept analysis, Modal characterisation theorems over special classes of frames, The Epistemology of Computer-Mediated Proofs, Classifying regular languages by a split game, On the Parameterized Complexity of [1,j-Domination Problems], Universally defining finitely generated subrings of global fields, The probability nesting game, Arity hierarchies, Logic and Game Theory, A logic-based approach to incremental reasoning on multi-agent systems, Adding for-loops to first-order logic, An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models, Probabilistic Modeling of Default Reasoning, On the desirability of mechanizing calculational proofs, Existential second-order logic and modal logic with quantified accessibility relations, Generalized logical consequence: Making room for induction in the logic of science, The epsilon calculus and Herbrand complexity