Piotr Kulicki

Aristotle in Analytica Posteriora presented a notion of proof as a special case of syllogism. In the present paper the remarks of Aristotle on the subject are used as an inspiration for developing formal systems of demonstrative syllogistic, which are supposed to formalize syllogisms that are proofs. We build our systems in the style of J. Łukasiewicz as theories based on classical propositional logic. The difference between our systems and systems of syllogistic known from the literature lays in the interpretation of general positive sentences in which the same name occurs twice (of the form SaS). As a basic assumption of demonstrative syllogistic we accept a negation of such a sentence. We present three systems which differ in the interpretation of specific positive sentences in which the same name occurs twice (of the form SiS). The theories are defined as axiomatic systems. For all of them rejected axiomatizations are also supplied. For two of them a set theoretical model is also defined.

A calculus of names is a logical theory describing relations between names. By a pure calculus of names we mean a quantifier-free formulation of such a theory, based on classical propositional calculus. An axiomatisation of a pure calculus of names is presented and its completeness is discussed. It is shown that the axiomatisation is complete in three different ways: with respect to a set theoretical model, with respect to Leśniewski's Ontology and in a sense defined with the use of axiomatic rejection. The independence of axioms is proved. A decision procedure based on syntactic transformations and models defined in the domain of only two members is defined

Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced his systems of basic deontic logic of urn model actions in early 1980s. Nowadays such logics are considered mainly within propositional dynamic logic (PDL). Two approaches can be distinguished: in one of them deontic operators are introduced using dynamic operators and the notion of violation, in the other at least some of them are taken as primitive. The second approach may be further divided into the systems based on Boolean algebra of actions and the systems built on the top of standard PDL. In the present paper we are interested in the systems of deontic action logic based on Boolean algebra. We present axiomatizations of six systems and set theoretical models for them. We also show the relations among them and the position of some existing theories on the resulting picture. Such a presentation allows the reader to see the spectrum of possibilities of formalization of the subject