The Completeness And Compactness Of A Three-Valued First-Order Logic.
The -propositional calculus
T. Almada and J. Vaz de Carvalho (2001) stated the problem to investigate if these Łukasiewicz algebras are algebras of some logic system. In this article an affirmative answer is given and the -propositional calculus, denoted by , is introduced in terms of the binary connectives (implication), (standard implication), (conjunction), (disjunction) and the unary ones (negation) and , (generalized Moisil operators). It is proved that belongs to the class of standard systems of implicative...
The non-axiomatizability of the observational predicate calculus (generalized Trachtenbrot's theorems)
The process of induction as a non-classical logic's double negation: evidence from classical scientific theories.
The Soft Logic of Thomas Harriot
Time conditional propositions