scientific article; zbMATH DE number 3885853
From MaRDI portal
Publication:3220545
zbMATH Open0556.03001MaRDI QIDQ3220545FDOQ3220545
Authors: Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
- Mathematical Logic
- Mathematical logic
- Mathematical logic. With a preface by A. Szerzo.
- scientific article; zbMATH DE number 1278449
- scientific article
- Sets, models and proofs
- scientific article; zbMATH DE number 193626
- scientific article; zbMATH DE number 1016911
- scientific article; zbMATH DE number 47925
- scientific article; zbMATH DE number 4121954
Classical first-order logic (03B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) General logic (03B99)
Cited In (60)
- Title not available (Why is that?)
- Game characterizations for the number of quantifiers
- Finite automata over infinite alphabets: two models with transitions for local change
- First-order logic on finite trees
- On the complexity of theories of permutations
- The structure of the models of decidable monadic theories of graphs
- Recursive definitions and fixed-points
- Specification of abstract dynamic-data types: A temporal logic approach
- Is universal computation a myth?
- April the 19th
- Algorithmic uses of the Feferman-Vaught theorem
- Listing graphs that satisfy first-order sentences
- Substitution revisited
- How to win a game with features
- Star-free picture expressions are strictly weaker than first-order logic
- Back-and-forth for systems of antichains
- Projection and scope-determined circumscription
- Abstract state machines and computationally complete query languages
- Finitely representable databases
- First-order predicate logic and Gödel's completeness theorem
- Quantified constraints under perturbation
- Possibility and impossibility results in a shared memory environment
- An algebraic approach to belief contraction and nonmonotonic entailment
- Observation equivalence as a testing equivalence
- A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\)
- On fork arrow logic and its expressive power
- How to win a game with features
- Initial failures in distributed computations
- Back-and-forth systems for fuzzy first-order models
- Large finite structures with few \(L^k\)-types
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract)
- Modulo-counting quantifiers over finite trees
- The mu-calculus and Model Checking
- Limits of mathematics. A journey through the core subjects of mathematical logic
- Foundations of a theorem prover for functional and mathematical uses
- Dialectical contradictions and classical formal logic
- The modal argument for hypercomputing minds
- On a complete set of generators for dot-depth two
- Logic with trees: an introduction to symbolic logic
- A Course in Mathematical Logic for Mathematicians
- The quasi-lattice of indiscernible elements
- Title not available (Why is that?)
- Atomic ontology
- Mathematical logic. With a preface by A. Szerzo.
- On elementary equivalence for equality-free logic
- What is the coalgebraic analogue of Birkhoff's variety theorem?
- A first-order axiomatization of the theory of finite trees
- Parametrization over inductive relations of a bounded number of variables
- Closed world assumptions having precedence in predicates
- Expressive Power and Decidability for Memory Logics
- Zero-place operations and functional completeness, and the definition of new connectives
- The correctness of nondeterministic programs revisited
- Incompleteness of first-order temporal logic with until
- An open formalism against incompleteness
- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
- The generic filter property in nonstandard analysis
- A survey of nonstandard sequent calculi
- On expressive power of basic modal intuitionistic logic as a fragment of classical FOL
- Model-theoretical foundation of action and progression
- A refutation of Penrose's Gödelian case against artificial intelligence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220545)
