Minimal Type Theory (YACC BNF)

Abstract

This is the formal YACC BNF specification for Minimal Type Theory (MTT). MTT was created by augmenting the syntax of First Order Logic (FOL) to specify Higher Order Logic (HOL) expressions using FOL syntax. Syntax is provided to enable quantifiers to specify type. FOL is a subset of MTT. The ASSIGN_ALIAS operator := enables FOL expressions to be chained together to form HOL expressions.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

The inconsistency of higher order extensions of Martin-löf's type theory.Bart Jacobs - 1989 - Journal of Philosophical Logic 18 (4):399 - 422.
An Intensional Type Theory: Motivation and Cut-Elimination.Paul C. Gilmore - 2001 - Journal of Symbolic Logic 66 (1):383-400.
Logic in the 1930s: type theory and model theory.Georg Schiemer & Erich H. Reck - 2013 - Bulletin of Symbolic Logic 19 (4):433-472.
Higher type categories.Martin Dowd - 1993 - Mathematical Logic Quarterly 39 (1):251-254.
Asymmetric RK-minimal types.Predrag Tanović - 2010 - Archive for Mathematical Logic 49 (3):367-377.
Higher Order Modal Logic.Reinhard Muskens - 2006 - In Patrick Blackburn, Johan Van Benthem & Frank Wolter (eds.), Handbook of Modal Logic. Elsevier. pp. 621-653.
An Overview of Type Theories.Nino Guallart - 2015 - Axiomathes 25 (1):61-77.

Analytics

Added to PP
2019-03-19

Downloads
267 (#74,934)

6 months
74 (#64,649)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references