No label defined (Q3789524)
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 4053565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4053565 |
Statements
1988
0 references
FOL
0 references
First Order Logic proof checker
0 references
many sorted logic
0 references
0.7365385293960571
0 references
0.7248046398162842
0 references
0.7233158946037292
0 references
0.7183742523193359
0 references
0.7134126424789429
0 references
[For the entire collection see Zbl 0635.00014.] First order theories not only can be used in proving properties of programs, but have also relevance in representation theory. The desire to represent first order theories in a computer in a feasible way requires the facility to discuss meta-mathematical notions. Using metamathematics will eventually allow to construct systems which can formally discuss how they reason. In this paper we present two different first order axiomatizations of the metamathematics of the logic which FOL (First Order Logic proof checker) checks and show several proofs using the two. The difference between the axiomatizations is that one defines the metamathematics in a many sorted logic and the other does not. Proofs are then compared and used to discuss the adequacy of some FOL features.
0 references