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
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 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 [
## 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