A finite axiomatization of the set of strongly valid Ockhamist formulas
type: Item
instance of: scholarly article
title: A finite axiomatization of the set of strongly valid Ockhamist formulas
zbMATH Open document ID: 0579.03015
DOI: 10.1007/BF00649485
author: Alberto Zanardo
published in: Journal of Philosophical Logic
publication date: 1985-01-01T00:00:00Z
review text: Ockhamist (propositional) logic is a normal 3-modal logic in which one operator, \(\diamond\), expresses S5-possibility and the others, P and F, are tense operators for linear time. The usual interpretations for this logic are trees and the propositional variables are assumed to range over a set \({\mathcal B}\) of branches. The ''accessibility'' relation connected with the tense operators is the set-theoretical inclusion between branches, while two branches are related with respect to \(\diamond\) iff they have the same initial point. Ockhamist strong validity is defined by requiring that (1) \({\mathcal B}\) is closed under inclusions and extensions and (2) for every point x in the tree, there is a branch in \({\mathcal B}\) which passes through x. In the paper a finite axiomatization is provided for this concept of validity. The main result is a sort of diagram-completion in \(<{\mathcal M},{\mathcal R},\prec >\), where \({\mathcal M}\) is the set of maximal consistent sets, \({\mathcal R}\) is the relation (on \({\mathcal M})\) corresponding to \(\diamond\), and \(\prec\) is the relation corresponding to P and F. There exists an equivalence relation \({\mathcal R}^*\subseteq {\mathcal R}\) satisfying the following conditions: (1) \({\mathcal R}^*\) has all the properties which are needed for a Kripke-Lemmon construction; (2) for all maximal consistent sets \(\Delta\), \(\Sigma\), \(\Gamma\), \(\Delta\) ', \(\Gamma\) ' if \(\Delta\) \(\prec \Sigma \prec \Gamma\), \(\Delta\) \({\mathcal R}^*\Delta '\), and \(\Gamma\) \({\mathcal R}^*\Gamma '\), then (at least in the relevant cases) \(\Sigma\) \({\mathcal R}^*\Sigma '\) and \(\Delta\) '\(\prec \Sigma '\prec \Gamma '\) hold for a suitable maximal consistent set \(\Sigma\) '.
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 3926883
zbMATH Keywords: Ockhamist logic
zbMATH Keywords: tense logic
zbMATH Keywords: modal logic
zbMATH Keywords: S5-possibility
zbMATH Keywords: tense operators
zbMATH Keywords: trees
MaRDI profile type: Publication
cites work: Logic and time
cites work: The unreal future
cites work: The decision problem for branching time logic
cites work: Q5556395
cites work: Modal logics with linear alternative relations
cites work: Q4342095
Recommended article: ON THE AXIOMATIZATION OF FINITE-VALUED LOGICAL CALCULI
Recommended article: Q3344181
Recommended article: Finitely axiomatizable theories
Recommended article: Q3813801
Recommended article: Some results on finite axiomatizability in modal logic
Recommended article: Optimal axiomatizations of finitely valued logics
Recommended article: Finite axiomatizability in Łukasiewicz logic
Recommended article: Q4304462
Recommended article: A note on strong axiomatization of Gödel justification logic
Recommended article: Q4249364
description: scientific article; zbMATH DE number 3926883