Unifying some modifications of the Henkin construction

Notre Dame Journal of Formal Logic 33 (3):450-460 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093634409

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Henkin quantifiers and the definability of truth.Tapani Hyttinen & Gabriel Sandu - 2000 - Journal of Philosophical Logic 29 (5):507-527.
A new semantics for intuitionistic predicate logic.Yuichi Komori - 1986 - Studia Logica 45 (1):9 - 17.
Explicit Henkin sentences.Robert M. Solovay - 1985 - Journal of Symbolic Logic 50 (1):91-93.
Henkin's completeness proof: forty years later.Hugues Leblanc, Peter Roeper, Michael Thau & George Weaver - 1991 - Notre Dame Journal of Formal Logic 32 (2):212-232.
Construction after construction and its theoretical challenges.Ray Jackendoff - manuscript
An abstract setting for Henkin proofs.Robert Goldblatt - 1984 - Topoi 3 (1):37-41.
Promoting peace in engineering education: Modifying the ABET criteria.George D. Catalano - 2006 - Science and Engineering Ethics 12 (2):399-406.
Spectra of formulae with Henkin quantifiers.Joanna Golinska-Pilarek & Konrad Zdanowski - 2003 - In A. Rojszczak, J. Cachro & G. Kurczewski (eds.), Philosophical Dimensions of Logic and Science. Kluwer Academic Publishers. pp. 29-45.
Consumer modification of copyrighted works.Alan L. Durham - manuscript
A Henkin-style completeness proof for the pure implicational calculus.George F. Schumm - 1975 - Notre Dame Journal of Formal Logic 16 (3):402-404.
Euler’s visual logic.Eric Hammer & Sun-Joo Shin - 1998 - History and Philosophy of Logic 19 (1):1-29.
Predicate logics without the structure rules.Yuichi Komori - 1986 - Studia Logica 45 (4):393 - 404.
Infinistic Methods.L. Henkin - 1961 - Pergamon Press.
Higher-order automated theorem proving.Michael Kohlhase - unknown

Analytics

Added to PP
2010-08-24

Downloads
21 (#741,388)

6 months
10 (#276,350)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references