A finitely Axiomatizable complete theory with atomless F1 (T).
A formal analysis of musical scores
A general deduction theorem.
In this paper we present a very general deduction theorem which -based upon a uniform notion of proof from hypotheses- holds for a very large class of logical systems. Most of the known results for classical and modal logics, as well as new results, are immediate corollaries of this theorem.
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 method for random sampling of well-formed formulas. (A method for random sampling of formulas of an elementary theory and statistical estimation of their deducibility equipped by a program. I.)
"Abstract logics" and "Classical abstract logics" [Book]
Automatické formování hypotéz metodou GUHA - teorie a aplikace
Definability in structures of finite valency
Definability in the extended arithmetic of ordinal numbers [Book]
Der erste Widerspruchsfreiheitsbeweis für die klassische Zahlentheorie.
Die Problematik apriorischer Wahrscheinlichkeiten im System der induktiven Logik von Rudolf Carnap.
Discourse on one way in which a quantum-mechanics language on the classical logical base can be built up
“Disorder” in lattices of binumerations
Eine Logik vager Sätze.
Eine Note zum System PC.
Erblich euklidische Körper.
First order topology [Book]
Lògiques distributives i booleanes.
Continuing the study of different types of Abstract Logics [5], and following works by Brown-Bloom [1] and Brown-Suszko [2], we analyze in this paper some logics in which, if we identify equivalent formulae by means of the consequence operator, we obtain distributive lattices or Boolean algebras.
Metric similarities in the logic of approximation.
We describe restricted and extended versions of the logic of approximation which is meant to handle formally the problems of measurement error and of deduction under conditions of uncertainty. We apply the logic to the foundations of social and behavioral inquiry, axiomatizing in it an inexact similarity predicate which behaves like a metric approximation to identity. In the restricted version of the logic we formulate conditions for the imbeddability of similarity models in the real line, and in...
Non-finitizability of a weak second-order theory