
27Relational logics and their applicationsIn Harrie de Swart, Ewa Orlowska, Gunther Smith & Marc Roubens (eds.), Theory and Applications of Relational Structures as Knowledge Instruments II: International Workshops of COST Action 274, TARSKI, 20022005, Selected Revised Papers, Springer. pp. 125161. 2006.Logics of binary relations corresponding, among others, to the class RRA of representable relation algebras and the class FRA of full relation algebras are presented together with the proof systems in the style of dual tableaux. Next, the logics are extended with relational constants interpreted as point relations. Applications of these logics to reasoning in nonclassical logics are recalled. An example is given of a dual tableau proof of an equation which is RRAvalid, while not RAvalid.

List of participants 17 Robert K. Meyer (Camberra, Australia) Barbara Morawska (Gdansk, Poland) Daniele Mundici (Milan, Italy)Logic and Logical Philosophy 7 16. 2001.

A proof system for fork algebras and its applications to reasoning in logics based on intuitionismLogique Et Analyse 150 151152. 1995.

5Logics in Artificial Intelligence: European Workshop, Jelia '96, Evora, Portugal, September 30  October 3, 1996, Proceedings (review)Springer Verlag. 1996.This book presents the refereed proceedings of the Sixth European Workshop on Logics in Artificial Intelligence, JELIA '96, held in Evora, Portugal in September/October 1996. The 25 revised full papers included together with three invited papers were selected from 57 submissions. Many relevant aspects of AI logics are addressed. The papers are organized in sections on automated reasoning, modal logics, applications, nonmonotonic reasoning, default logics, logic programming, temporal and spatial …Read more

8A Relational Formalisation Of Arbitrary Finite Valued LogicsLogic Journal of the IGPL 6 (5): 755774. 1998.A method of developing a relational semantics and relational proof systems for manyvalued logics based on finite algebras of truth values is presented. The method is applied to RosserTurquette logic, logics based on symmetric Heyting algebras with operators and a Poststyle logic

3Logics in Artificial Intelligence: Proceedings of European Workshop, Jelia '96, Évora, Portugal, September 30October 3, 1996 (edited book, review)Springer. 1996.

49Relational proof systems for spatial reasoningJournal of Applied NonClassical Logics 16 (34): 409431. 2006.We present relational proof systems for the four groups of theories of spatial reasoning: contact relation algebras, Boolean algebras with a contact relation, latticebased spatial theories, spatial theories based on a proximity relation

Logic of vague conceptsBulletin of the Section of Logic 11 (34): 115126. 1982.This paper contains a logic enabling us to reason in the presence of vague ness phenomena. We consider an epistemological vagueness of concepts caused by the unavailability of total information about a continuous world which we describe in observational terms. Lack of information is manifested by the existence of borderline cases for concepts. Since we are unable to perceive concepts exactly, we cannot establish a sharp boundary between an extension of a concept and its complement. Some results…Read more

Three aspects of verisimilitude. Part IIBulletin of the Section of Logic 16 (4): 140147. 1987.In the following two sections we propose ordering relations for which the material for comparison of theories of concepts the theories deal with. The relations refer to what is called concept analysis. In the present section we introduce relations enabling us to compare theories from the point of view of the following aspect: How well the theories in question classify objects into positive and negative instances of concepts. Classiﬁcations of objects provided by a theory can be correct or incorr…Read more

Three aspects of verisimilitude. Part IBulletin of the Section of Logic 16 (3): 96103. 1987.One of the generalizations of R. W´ojcicki’s concept of referential matrix is socalled pseudoreferential matrix. G. Malinowski, who introduced that concept, also considers a particular case of pseudoreferential matrices called discrete pseudoreferential matrices. In this note we want to show how any generalized matrix determines a semantically equivalent discrete pseudoreferential matrix.

1Relational interpretation of modal logicsBulletin of the Section of Logic 17 (1): 210. 1988.The purpose of the present paper is to show that modal propositional logics can be interpreted in a logic based on relational calculus. We consider languages with necessity operators [R], where R is an accessibility relation expression representing an element of the algebra of binary relations with operations −,∪,∩, −1 , ◦. The relational logic is based on relational calculus enriched by operations of weakest prespeciﬁcation and weakest postspeciﬁcation introduced in Hoare and He Jifeng and inve…Read more

39Modal Logics in the Theory of Information SystemsMathematical Logic Quarterly 30 (1316): 213222. 1984.

47Dual Tableaux: Foundations, Methodology, Case StudiesSpringer. 2011.The book presents logical foundations of dual tableaux together with a number of their applications both to logics traditionally dealt with in mathematics and philosophy (such as modal, intuitionistic, relevant, and manyvalued logics) and to various applied theories of computational logic (such as temporal reasoning, spatial reasoning, fuzzysetbased reasoning, roughsetbased reasoning, orderof magnitude reasoning, reasoning about programs, threshold logics, logics of conditional decisions).…Read more

65A discrete duality between apartness algebras and apartness framesJournal of Applied NonClassical Logics 18 (23): 213227. 2008.Apartness spaces were introduced as a constructive counterpart to proximity spaces which, in turn, aimed to model the concept of nearness of sets in a metric or topological environment. In this paper we introduce apartness algebras and apartness frames intended to be abstract counterparts to the apartness spaces of (Bridges et al., 2003), and we prove a discrete duality for them.

1Interpretation of relevant logics in a logic of ternary relationsBulletin of the Section of Logic 19 (No2): 3949. 1990.

53Relational dual tableaux for interval temporal logicsJournal of Applied NonClassical Logics 16 (34). 2006.Interval temporal logics provide both an insight into a nature of time and a framework for temporal reasoning in various areas of computer science. In this paper we present sound and complete relational proof systems in the style of dual tableaux for relational logics associated with modal logics of temporal intervals and we prove that the systems enable us to verify validity and entailment of these temporal logics. We show how to incorporate in the systems various relations between intervals an…Read more

Relational logics for formalization of database dependenciesBulletin of the Section of Logic 27. 1998.

56Relational proof system for relevant logicsJournal of Symbolic Logic 57 (4): 14251440. 1992.A method is presented for constructing natural deductionstyle systems for propositional relevant logics. The method consists in first translating formulas of relevant logics into ternary relations, and then defining deduction rules for a corresponding logic of ternary relations. Proof systems of that form are given for various relevant logics. A class of algebras of ternary relations is introduced that provides a relationalgebraic semantics for relevant logics

30Duality via Truth: Semantic frameworks for latticebased logicsLogic Journal of the IGPL 13 (4): 467490. 2005.A method of defining semantics of logics based on not necessarily distributive lattices is presented. The key elements of the method are representation theorems for lattices and duality between classes of lattices and classes of some relational systems . We suggest a type of duality referred to as a duality via truth which leads to Kripkestyle semantics and threevalued semantics in the style of AllweinDunn. We develop two new representation theorems for lattices which, together with the exist…Read more

39Equational Reasoning in NonClassical LogicsJournal of Applied NonClassical Logics 8 (12): 2766. 1998.ABSTRACT In this paper it is shown that a broad class of propositional logics can be interpreted in an equational logic based on fork algebras. This interpetability enables us to develop a forkalgebraic formalization of these logics and, as a consequence, to simulate nonclassical means of reasoning with equational theories algebras

Tense logic for nondeterministic timeBulletin of the Section of Logic 11 (34): 127131. 1982.We present an approach to nondeterministic time based on a concept of nondeterministic world. A nondeterministic world is a set of some equipos sible states. Such a world is not treated as whole, it is neither atomic nor indivisible. Given a world representing the present, the past worlds are its subsets and the future worlds are sets in which it is contained. Thus we assume that worlds involve change and the way they change is expansion. In our approach indeterminism occurs in the two levels. …Read more

18Obituary Zdzislaw Pawlak (1926–2006)Journal of Applied NonClassical Logics 17 (1): 78. 2007.No abstract

39Logic For Reasoning About KnowledgeZeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (6): 559572. 1989.One of the important issues in research on knowledge based computer systems is development of methods for reasoning about knowledge. In the present paper semantics for knowledge operators is introduced. The underlying logic is developed with epistemic operators relative to indiscernibility. Facts about knowledge expressible in the logic are discussed, in particular common knowledge and joint knowledge of n group of agents. Some paradoxes of epistemic logic are shown to be eliminated in the given…Read more

A Logic With Relevant InplicationBulletin of the Section of Logic 16 (1): 3943. 1987.In Orlowska and Weingartner an approach to relevance was proposed based on the notion of sematic relevance criterion which is understood as a binary relation in the set of predicates of a language under consideration. Some general properties were investigated of sets of formulas relevant with respect to relevance criteria or sets of relevance criteria. Informally, a predicate P is relevant for a predicate Q whenever some information about instances of Q can be derived from information about inst…Read more

18Dual tableaubased decision procedures for relational logics with restricted composition operatorJournal of Applied NonClassical Logics 21 (2): 177200. 2011.We consider fragments of the relational logic RL(1) obtained by posing various constraints on the relational terms involving the operator of composition of relations. These fragments allow to express several non classical logics including modal and description logics. We show how relational dual tableaux can be employed to provide decision procedures for each of them.
Areas of Specialization
Logic and Philosophy of Logic 
Philosophy of Mathematics 