scholarly journals Weak Completeness of Coalgebraic Dynamic Logics

2015 ◽  
Vol 191 ◽  
pp. 90-104 ◽  
Author(s):  
Helle Hvid Hansen ◽  
Clemens Kupke
Keyword(s):  
Weak Completeness ◽  
Dynamic Logics

On Sequential Form of Functional Dynamic Logics

1984 ◽  
Vol 7 (3) ◽  
pp. 357-358
Author(s):  
Regimantas Pliuškevičius
Keyword(s):  
Axiom Systems ◽  
Dynamic Logics

A Gentzen-style axiomatization of dynamic logics is proposed. It is compared to other axiom systems for dynamic logics. Some problems of relative decidability are considered.

A weak completeness theorem for infinite valued first-order logic

1963 ◽  
Vol 28 (1) ◽  
pp. 43-50 ◽  
Author(s):  
L. P. Belluce ◽  
C. C. Chang
Keyword(s):  
Completeness Theorem ◽  
Unit Interval ◽  
Order Logic ◽  
First Order Logic ◽  
Order System ◽  
First Order ◽  
Recursively Enumerable ◽  
Weak Completeness ◽  
Truth Value

This paper contains some results concerning the completeness of a first-order system of infinite valued logicThere are under consideration two distinct notions of completeness corresponding to the two notions of validity (see Definition 3) and strong validity (see Definition 4). Both notions of validity, whether based on the unit interval [0, 1] or based on linearly ordered MV-algebras, use the element 1 as the designated truth value. Originally, it was thought by many investigators in the field that one should be able to prove that the set of valid sentences is recursively enumerable. It was first proved by Rutledge in [9] that the set of valid sentences in the monadic first-order infinite valued logic is recursively enumerable.

On the strong semantical completeness of the intuitionistic predicate calculus

1968 ◽  
Vol 33 (1) ◽  
pp. 1-7 ◽  
Author(s):  
Richmond H. Thomason
Keyword(s):  
Model Theory ◽  
Completeness Theorem ◽  
Predicate Calculus ◽  
First Order ◽  
Semantic Tableaux ◽  
Weak Completeness ◽  
Skolem Theorem ◽  
Completeness Theorems

In Kripke [8] the first-order intuitionjstic predicate calculus (without identity) is proved semantically complete with respect to a certain model theory, in the sense that every formula of this calculus is shown to be provable if and only if it is valid. Metatheorems of this sort are frequently called weak completeness theorems—the object of the present paper is to extend Kripke's result to obtain a strong completeness theorem for the intuitionistic predicate calculus of first order; i.e., we will show that a formula A of this calculus can be deduced from a set Γ of formulas if and only if Γ implies A. In notes 3 and 5, below, we will indicate how to account for identity, as well. Our proof of the completeness theorem employs techniques adapted from Henkin [6], and makes no use of semantic tableaux; this proof will also yield a Löwenheim-Skolem theorem for the modeling.

scholarly journals The comparison of the expressive power of first-order dynamic logics

1983 ◽  
Vol 27 (1-2) ◽  
pp. 197-209 ◽  
Author(s):  
A.P. Stolboushkin ◽  
M.A. Taitslin
Keyword(s):  
Expressive Power ◽  
First Order ◽  
Dynamic Logics

scholarly journals Decidability of finite probabilistic propositional dynamic logics

1991 ◽  
Vol 94 (2) ◽  
pp. 180-203 ◽  
Author(s):  
M. Tiomkin ◽  
J.A. Makowsky
Keyword(s):  
Dynamic Logics

A Weak Completeness Theorem for Infinite Valued First-Order Logic.

1971 ◽  
Vol 36 (2) ◽  
pp. 332
Author(s):  
Bruno Scarpellini ◽  
L. P. Belluce ◽  
C. C. Chang
Keyword(s):  
Completeness Theorem ◽  
Order Logic ◽  
First Order Logic ◽  
First Order ◽  
Weak Completeness
Sign in / Sign up

Export Citation Format

Share Document