An intuitionistic completeness theorem for classical predicate logic (Q708927)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5800412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An intuitionistic completeness theorem for classical predicate logic |
scientific article; zbMATH DE number 5800412 |
Statements
An intuitionistic completeness theorem for classical predicate logic (English)
0 references
15 October 2010
0 references
The completeness of intuitionistic first-order logic with respect to the corresponding class of structures can be proved via a purely intuitionistic argument establishing a connection between Beth forcing and intuitionistic validity. The author shows that a similar argument leads to an intuitionistic version of Gödel's completeness theorem for classical first-order logic.
0 references
classical predicate logic
0 references
Gödel completeness theorem
0 references
intuitionistic completeness proof
0 references
0.8572998642921448
0 references
0.8428534865379333
0 references
0.8262629508972168
0 references
