Axiomatization of BLRI Determined by Limited Positive Relational Properties

Logic and Logical Philosophy:1-29 (forthcoming)
  Copy   BIBTEX


In the paper a generalised method for obtaining an adequate axiomatic system for any relating logic expressed in the language with Boolean connectives and relating implication, determined by the limited positive relational properties is studied. The method of defining axiomatic systems for logics of a given type is called an algorithm since the analysis allows for any logic determined by the limited positive relational properties to define the adequate axiomatic system automatically, step-by-step. We prove in the paper that the algorithm really works and we show how it can be applied to BLRI.



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Causation by relational properties.Wim De Muijnck - 2002 - Grazer Philosophische Studien 65 (1):123-137.
On Some Method Of Axiomatization Of Some Propositional Calculi.Zdzislaw Dywan - 1986 - Bulletin of the Section of Logic 15 (2):52-56.
Relational Holism and Quantum Mechanics1.Paul Teller - 1986 - British Journal for the Philosophy of Science 37 (1):71-81.


Added to PP

6 (#1,430,516)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Tomasz Jarmużek
Nicolaus Copernicus University
Mateusz Klonowski
Nicolaus Copernicus University

Citations of this work

Relating Semantics for Hyper-Connexive and Totally Connexive Logics.Jacek Malinowski & Ricardo Arturo Nicolás-Francisco - 2023 - Logic and Logical Philosophy (Special Issue: Relating Logic a):1-14.

Add more citations