Completeness of intuitionistic predicate calculus with the concept of ''bar'' (Q1062671)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Completeness of intuitionistic predicate calculus with the concept of bar |
scientific article; zbMATH DE number 3914296
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completeness of intuitionistic predicate calculus with the concept of ''bar'' |
scientific article; zbMATH DE number 3914296 |
Statements
Completeness of intuitionistic predicate calculus with the concept of ''bar'' (English)
0 references
1984
0 references
The author formulates a sequential variant of intuitionistic predicate calculus with an additional one-place logical connective that is interpreted on Kripke tree models by the notion of ''bar.'' Completeness is proved in the class of models on trees of height up to \(\omega^ 2\).
0 references
sequential variant of intuitionistic predicate calculus
0 references
Kripke tree models
0 references
0.7932698130607605
0 references
0.7677241563796997
0 references