A calculus for finitely satisfiable formulas with identity.
A measure theoretic approach to logical quantification
A method for random sampling of formulas of an elementary theory and statistical estimation of their deducibility equipped by a program. II. A method for statistical testing of an at random sampled formula
A note on embedding problems
A proof of Rasiowa-Sikorski theorem via complete sequences
A Proof Procedure for the First Order Logic
A Survey of the m-M Calculus
An introduction to algorithmic logic. Metamathematical investigations in the theory of programs
Anzahlquantoren in der Prädikatenlogik
Approximation theory of uniqueness conditions by existence conditions
Axiomatisation des manipulations symboliques en calcul des prédicats
Compactness and Löwenheim-Skolem properties in categories of pre-institutions
The abstract model-theoretic concepts of compactness and Löwenheim-Skolem properties are investigated in the "softer" framework of pre-institutions [18]. Two compactness results are presented in this paper: a more informative reformulation of the compactness theorem for pre-institution transformations, and a theorem on natural equivalences with an abstract form of the first-order pre-institution. These results rely on notions of compact transformation, which are introduced as arrow-oriented generalizations...
Deciding whether a relation defined in Presburger logic can be defined in weaker logics
We consider logics on and which are weaker than Presburger arithmetic and we settle the following decision problem: given a k-ary relation on and which are first order definable in Presburger arithmetic, are they definable in these weaker logics? These logics, intuitively, are obtained by considering modulo and threshold counting predicates for differences of two variables.
Definability of arithmetical operations from binary quadratic forms
Ein Vollständigkeitsbeweis für schnittfreie Kalküle mit der Maximalisierungsmethode von Henkin.
Eine algebraische Konstruktion abzählbarer Modelle.
Eine Logik vager Sätze.
Equational Reformulations of Intuitionistic Propositional Calculus and Classical First-order Predicate Calculus
First order topology [Book]
Gültigkeitsbegriffe für Gleichungen in partiellen Algebren.