On reduced products of Kripke models.
On representations of logics
Probability Logics
Propositional calculus for adjointness lattices.
(Pure) logic out of probability.
Today, Logic and Probability are mostly seen as independent fields with a separate history and set of foundations. Against this dominating perception, only a very few people (Laplace, Boole, Peirce) have suspected there was some affinity or relation between them. The truth is they have a considerable common ground which underlies the historical foundation of both disciplines and, in this century, has prompted notable thinkers as Reichenbach [14], Carnap [2] [3] or Popper [12] [13] (and Gaifman [5],...
Remarks In Da Costa's Paraconsistent Set Theories.
Remarks on the definitions of main concepts of logic of action
The article presents the definitions of action and of its omission, formulated in some logical theories of action. The concern of the analysis is to point at manifold possibilities of precising the intuitive sense of discussed concepts depending on the theory. The utility of a particular definition may be evaluated when the domain of applicability of the theory is taken into account ; application often becomes justification for the choice of a given definition.
Strong completeness of the Lambek Calculus with respect to Relational Semantics
In [vB88], Johan van Benthem introduces Relational Semantics (RelSem for short), and states Soundness Theorem for Lambek Calculus (LC) w.r.t. RelSem. After doing this, he writes: "it would be very interesting to have the converse too", i.e., to have Completeness Theorem. The same question is in [vB91, p. 235]. In the following, we state Strong Completeness Theorems for different versions of LC.
Studies In Paraconsistent Logic II: Quantifiers And The Unity Of Opposites.
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
Базы допустимых правил логик S4 и Int
Интерполяционное свойство и суперинтуиционистские предикатные логики
Критерий допустимости правил в модальной системе S4 и интуиционистской логике.
Независимые базисы для правил, допустимых в предтабличных логиках
О выразительной силе некоторых динамических логик