5 research outputs found
Strong completeness of a first-order temporal logic for real time
Propositional temporal logic over the real number time flow is finitely
axiomatisable, but its first-order counterpart is not recursively
axiomatisable. We study the logic that combines the propositional
axiomatisation with the usual axioms for first-order logic with identity, and
develop an alternative ``admissible'' semantics for it, showing that it is
strongly complete for admissible models over the reals. By contrast there is no
recursive axiomatisation of the first-order temporal logic of admissible models
whose time flow is the integers, or any scattered linear ordering
Some Pioneering Formal Reconstructions of Diodorus' Master Argument
The article deals with some current pioneering formal reconstructions and interpretations of the problem well known in antiquity as The Master Argument. This problem is concerning with enrichment of formal logical systems with modal and temporal notions. The opening topic is devoted to reconstruction of Arthur Prior. while the other here included approach to the problem arc mostly reactions. revisions or additions to this one
Studies on modal logics of time and space
This dissertation presents original results in Temporal Logic and Spatial Logic. Part I concerns Branching-Time Logic. Since Prior 1967, two main semantics for Branching-Time Logic have been devised: Peircean and Ockhamist semantics. Zanardo 1998 proposed a general semantics, called Indistinguishability semantics, of which Peircean and Ockhamist semantics are limit cases. We provide a finite axiomatization of the Indistinguishability logic of upward endless bundled trees using a non-standard inference rule, and prove that this logic is strongly complete.
In Part II, we study the temporal logic given by the tense operators F for future and P for past together with the derivative operator , interpreted on the real numbers. We prove that this logic is neither strongly nor Kripke complete, it is PSPACE-complete, and it is finitely axiomatizable.
In Part III, we study the spatial logic given by the derivative operator and the graded modalities {n | n in N}. We prove that this language, call it L, is as expressive as the first-order language Lt of Flum and Ziegler 1980 when interpreted on T3 topological spaces. Then, we give a general definition of modal operator: essentially, a modal operator will be defined by a formula of Lt with at most one free variable. If a modal operator is defined by a formula predicating only over points, then it is called point-sort operator. We prove that L, even if enriched with all point-sort operators, however enriched with finitely many modal operators predicating also on open sets, cannot express Lt on T2 spaces. Finally, we axiomatize the logic of any class between all T1 and all T3 spaces and prove that it is PSPACE-complete.Open Acces