scientific article
From MaRDI portal
Publication:3220545
zbMath0556.03001MaRDI QIDQ3220545
Jörg Flum, Wolfgang Thomas, Heinz-Dieter Ebbinghaus
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical first-order logic (03B10) General logic (03B99)
Related Items
Modulo-counting quantifiers over finite trees, A refutation of Penrose's Gödelian case against artificial intelligence, Listing graphs that satisfy first-order sentences, On the Ehrenfeucht-Fraïssé game in theoretical computer science, On the complexity of theories of permutations, An algebraic approach to belief contraction and nonmonotonic entailment, The mu-calculus and Model Checking, Foundations of a theorem prover for functional and mathematical uses, On elementary equivalence for equality-free logic, Possibility and impossibility results in a shared memory environment, A first-order axiomatization of the theory of finite trees, Substitution revisited, Back-and-forth for systems of antichains, Model-theoretical foundation of action and progression, Algorithmic uses of the Feferman-Vaught theorem, Finitely representable databases, Star-free picture expressions are strictly weaker than first-order logic, Incompleteness of first-order temporal logic with until, First-order logic on finite trees, Specification of abstract dynamic-data types: A temporal logic approach, Expressive Power and Decidability for Memory Logics, The quasi-lattice of indiscernible elements, Projection and scope-determined circumscription, Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change, Quantified Constraint Satisfaction and the Polynomially Generated Powers Property, Initial failures in distributed computations, Parametrization over inductive relations of a bounded number of variables, Closed world assumptions having precedence in predicates, The modal argument for hypercomputing minds, On fork arrow logic and its expressive power, A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\), On expressive power of basic modal intuitionistic logic as a fragment of classical FOL, A survey of nonstandard sequent calculi, An open formalism against incompleteness, Recursive Definitions and Fixed-Points, The generic filter property in nonstandard analysis, Observation equivalence as a testing equivalence, Is Universal Computation a Myth?, Large finite structures with few \(L^k\)-types, What is the coalgebraic analogue of Birkhoff's variety theorem?, Back-and-forth systems for fuzzy first-order models, Atomic ontology, How to win a game with features, The correctness of nondeterministic programs revisited, How to win a game with features, Dialectical Contradictions and Classical Formal Logic, Abstract state machines and computationally complete query languages, Quantified constraints under perturbation, Zero-place operations and functional completeness, and the definition of new connectives, The structure of the models of decidable monadic theories of graphs, On a complete set of generators for dot-depth two
