Search ETDs:
Completeness of the Predicate Calculus in the Basic Theory of Predication
Florio, Salvatore

2010, Master of Science, Ohio State University, Mathematics.
In the first part of the thesis, we present the Basic Theory of Predication as elaborated by Harvey Friedman. Within the Basic Theory of Predication, we develop arithmetic and the basic semantic notions for the predicate calculus. The domains of the structures for the predicate calculus are unrestricted. That is, the quantifiers of the predicate calculus are interpreted as ranging over the universe of the metatheory, the Basic Theory of Predication.
In the second part of the thesis, we outline the proof of a completeness theorem for the predicate calculus. According to the theorem, on the assumption that the universe of the metatheory is linearly ordered, every set of sentences consistent with infinity is satisfiable.
Harvey Friedman, PhD (Committee Chair)
Neil Tennant, PhD (Committee Member)
68 p.

Recommended Citations

Hide/Show APA Citation

Florio, S. (2010). Completeness of the Predicate Calculus in the Basic Theory of Predication. (Electronic Thesis or Dissertation). Retrieved from https://etd.ohiolink.edu/

Hide/Show MLA Citation

Florio, Salvatore. "Completeness of the Predicate Calculus in the Basic Theory of Predication." Electronic Thesis or Dissertation. Ohio State University, 2010. OhioLINK Electronic Theses and Dissertations Center. 25 Sep 2017.

Hide/Show Chicago Citation

Florio, Salvatore "Completeness of the Predicate Calculus in the Basic Theory of Predication." Electronic Thesis or Dissertation. Ohio State University, 2010. https://etd.ohiolink.edu/

Files

osu1281927327.pdf (346.41 KB) View|Download