Some Superconstructive Propositional Calculi.

1970 ◽  
Vol 35 (1) ◽  
pp. 138
Author(s):  
Gene F. Rose ◽  
V. A. Jankov ◽  
Sue Walker ◽  
Elliott Mendelson
Keyword(s):  
Propositional Calculi

Two variable implicational calculi of prescribed many-one degrees of unsolvability

1976 ◽  
Vol 41 (1) ◽  
pp. 39-44 ◽  
Author(s):  
Charles E. Hughes
Keyword(s):  
Decision Problems ◽  
Constructive Proof ◽  
Distinct Variable ◽  
The Family ◽  
Propositional Calculi ◽  
Degrees Of Unsolvability

AbstractA constructive proof is given which shows that every nonrecursive r.e. many-one degree is represented by the family of decision problems for partial implicational propositional calculi whose well-formed formulas contain at most two distinct variable symbols.

On simple, weak and strong models of propositional calculi

1973 ◽  
Vol 74 (1) ◽  
pp. 1-9 ◽  
Author(s):  
Ronald Harrop
Keyword(s):  
Simple Model ◽  
Propositional Calculus ◽  
Finite Model ◽  
Model Property ◽  
Finite Model Property ◽  
Finite Structure ◽  
Propositional Calculi ◽  
Simple Models

In this paper we will be concerned primarily with weak, strong and simple models of a propositional calculus, simple models being structures of a certain type in which all provable formulae of the calculus are valid. It is shown that the finite model property defined in terms of simple models holds for all calculi. This leads to a new proof of the fact that there is no general effective method for testing, given a finite structure and a calculus, whether or not the structure is a simple model of the calculus.

Some n-valued Propositional Calculi: A Selection

1992 ◽  
pp. 79-94
Author(s):  
Leonard Bolc ◽  
Piotr Borowik
Keyword(s):  
Propositional Calculi
Sign in / Sign up

Export Citation Format

Share Document