𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The logical consequence relation of propositional tense logic

✍ Scribed by S. K. Thomason


Publisher
John Wiley and Sons
Year
1975
Tongue
English
Weight
718 KB
Volume
21
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


This work concerns the model theory of propositional tense logic with the K R ~K E relational semantics. It is shown (i) that there is a formula y whose logical consequences form a complete l7: set, and (ii) that for 0 m < o + o there are formulas y,, such that all models of y m are isomorphic and have cardinality x , , where xo = u0, x,,, t 1 = 2xm, and x, = lim{x,, I m < o } . Familiarity with the relational semantics for modal and tense logic ([l] or [3], for example) will be presumed. A knowledge of recursion theory would be helpful, although some background material will be provided.


πŸ“œ SIMILAR VOLUMES


On fuzzification of propositional logics
✍ Branislav BoričiΔ‡ πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 108 KB

By fuzziΓΏcation we mean a procedure which assigns a fuzzy logic to an arbitrary crisp logic. In this paper we describe two essentially di erent fuzziΓΏcation procedures. In order to give a formal description of the notion of fuzziness of a formula, we extend the language of the propositional logic by

On the Decidability of Propositional Alg
✍ Bogdan S. Chlebus πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 802 KB

ON THE DECIDABILITY OF PROPOSITIONAL ALGORITHMIC LOGIC by BOGDAN S. CHLEBIJS in Warsaw (Po1and)l) 0. Introduction Let PAL be a n abbreviation for propositional algorithmic logic. The investigation of PAL is a continuation of earlier works on algorithmic logic (GRABOWSKI [3], KRECZMAR [5], SALWICKI [

A topological characterization of consis
✍ Guo-Jun Wang; Yan-Hong She πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

## Abstract The main purpose of this note is to characterize consistency of logic theories in propositional logic by means of topological concept. Based on the concepts of truth degree of formulas and similarity degree between formulas the concept of logic metric space has been proposed by the firs