Decision Times of Infinite Computations

Notre Dame Journal of Formal Logic 63 (2) (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

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

Through your library

Similar books and articles

Primitive recursive computations.Stephen H. McCleary - 1967 - Notre Dame Journal of Formal Logic 8 (4):311-317.
Infinite truth-functional logic.Theodore Hailperin - 1987 - Notre Dame Journal of Formal Logic 29 (1):28-33.
Infinite sets of nonequivalent modalities.Fabio Bellissima - 1989 - Notre Dame Journal of Formal Logic 30 (4):574-582.
Passages between finite and infinite.Alexander Abian - 1978 - Notre Dame Journal of Formal Logic 19 (3):452-456.
A note on Philip Kitcher's analysis of mathematical truth.Thomas M. Norton-Smith - 1991 - Notre Dame Journal of Formal Logic 33 (1):136-139.
Combinatorial designs on infinite sets.William J. Frascella - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):27-47.
A stronger definition of a recursively infinite set.Charles H. Applebaum - 1973 - Notre Dame Journal of Formal Logic 14 (3):411-412.
On infinite matrices and the paradoxes of material implication.W. C. Wilcox - 1970 - Notre Dame Journal of Formal Logic 11 (2):254-256.
Maximal subgroups of infinite symmetric groups.James E. Baumgartner, Saharon Shelah & Simon Thomas - 1992 - Notre Dame Journal of Formal Logic 34 (1):1-11.
Infinite series of $T$-regressive isols.Judith L. Gersting - 1973 - Notre Dame Journal of Formal Logic 14 (4):519-526.

Analytics

Added to PP
2022-06-10

Downloads
26 (#851,330)

6 months
5 (#1,038,502)

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

Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Π11 Borel sets.Alexander S. Kechris, David Marker & Ramez L. Sami - 1989 - Journal of Symbolic Logic 54 (3):915 - 920.

View all 6 references / Add more references