Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T11:21:45.130Z Has data issue: false hasContentIssue false

A tableau system of proof for predicate-functor logic with identity1

Published online by Cambridge University Press:  12 March 2014

Teo Grünberg*
Affiliation:
Orta Doǧu Teknik Üniversitesi, Ankara, Turkey

Extract

Quine has given a method for eliminating the bound variables in first-order predicate logic establishing thus a variable-free formulation called predicate-functor logic. The purpose of this paper is to give an autonomous and complete proof procedure for Quine's predicate-functor logic with identity, without presupposing axioms or inference rules for quantification theory or, for that matter, any other logic.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable