Mike Townsend. Complexity for type-2 relations. Notre Dame journal of formal logic, vol. 31 , pp. 241–262

Journal of Symbolic Logic 58 (1):360 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275350

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Complexity for type-$2$ relations. [REVIEW]Mike Townsend - 1990 - Notre Dame Journal of Formal Logic 31 (2):241-262.
Review: Mike Townsend, Complexity for Type-2 Relations. [REVIEW]Bruce Kapron - 1993 - Journal of Symbolic Logic 58 (1):360-360.
On Bounded Type-Definable Equivalence Relations.Ludomir Newelski & Krzysztof Krupi?Ski - 2002 - Notre Dame Journal of Formal Logic 43 (4):231-242.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
Curry Haskell B.. A theory of formal deducibility. Second edition of XVI 56. Notre Dame mathematical lectures, no. 6. Lithoprinted. University of Notre Dame, Notre Dame, Indiana, 1957, xi + 129 pp. [REVIEW]Ann S. Ferebee - 1969 - Journal of Symbolic Logic 34 (1):113-113.
Curry Haskell B.. A theory of formal deducibility. Notre Dame mathematical lectures, no. 6. Lithoprinted. University of Notre Dame, Notre Dame, Indiana, 1950, ix + 126 Seiten. [REVIEW]Wilhelm Ackermann - 1951 - Journal of Symbolic Logic 16 (1):56-58.
Ashworth E. J.. Propositional logic in the sixteenth and early seventeenth centuries. Notre Dame journal of formal logic, vol. 9 no. 2 , pp. 179–192.Ashworth E. J.. Petrus Fonseca and material implication. Notre Dame journal of formal logic, vol. 9 no. 3 , pp. 227–228. [REVIEW]Martin M. Tweedale - 1971 - Journal of Symbolic Logic 36 (2):323-324.
Complexity of model-theoretic notions.Russell W. Myers - 1980 - Notre Dame Journal of Formal Logic 21 (4):656-658.
Equivalence relations and ${\rm S}5$.G. E. Hughes - 1980 - Notre Dame Journal of Formal Logic 21 (3):577-584.
Equivalence Relations And S.G. E. Hughes - 1980 - Notre Dame Journal of Formal Logic 21 (July):577-584.
Second-order quantifiers and the complexity of theories.J. T. Baldwin & S. Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):229-303.
Classical logical relations.A. J. Baker - 1977 - Notre Dame Journal of Formal Logic 18 (1):164-168.
Kripke-type semantics for Da Costa's paraconsistent logic "C" w.Matthias Baaz - 1986 - Notre Dame Journal of Formal Logic 27:523-527.
Relations irreducible to classes.F. G. Asenjo - 1963 - Notre Dame Journal of Formal Logic 4 (3):193-200.
Expressibility in type theory.H. Julian Wadleigh - 1970 - Notre Dame Journal of Formal Logic 11 (3):257-288.

Analytics

Added to PP
2016-06-30

Downloads
23 (#644,212)

6 months
10 (#219,185)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references