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