- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Nondeterministic Ω-Computations and the Analytical Hierarchy
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (4):333-342 (1989)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Nondeterministic Ω‐Computations and the Analytical Hierarchy.J. Castro & F. Cucker - 1989 - Mathematical Logic Quarterly 35 (4):333-342.
Analytical tableaux for da Costa's hierarchy of paraconsistent logics Cn, 1≤n<ω.Itala M. Loffredo D'Ottaviano & Milton Augustinis de Castro - 2005 - Journal of Applied Non-Classical Logics 15 (1):69-103.
Tense logic for nondeterministic time.Ewa Orlowska - 1982 - Bulletin of the Section of Logic 11 (3-4):127-131.
Relating word and tree automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.
Nondeterministic three-valued logic: Isotonic and guarded truth-functions.Peter Päppinghaus & Martin Wirsing - 1983 - Studia Logica 42 (1):1 - 22.
Equational derivation vs. computation.W. G. Handley & S. S. Wainer - 1994 - Annals of Pure and Applied Logic 70 (1):17-49.
Analytical tableaux for da Costa's hierarchy of paraconsistent logics Cn, 1≤n<ω.Itala M. Loffredo D'Ottaviano & Milton Augustinis De Castro - 2005 - Journal of Applied Non-Classical Logics 15 (1):69-103.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
An Analysis of the W -Hierarchy.Yijia Chen, Jörg Flum & Martin Grohe - 2007 - Journal of Symbolic Logic 72 (2):513 - 534.
A faithful embedding of parallel computations in star-finite models.E. J. Farkas - 1988 - Studia Logica 47 (3):203 - 212.
What is analytical philosophy?Cesare Cozzo - 1999 - In Rosaria Egidi (ed.), In Search of a New Humanism. Kluwer Academic Publishers. pp. 55-63.
Extensions of arithmetic for proving termination of computations.Clement F. Kent & Bernard R. Hodgson - 1989 - Journal of Symbolic Logic 54 (3):779-794.
Systems of notations and the ramified analytical hierarchy.Joan D. Lukas & Hilary Putnam - 1974 - Journal of Symbolic Logic 39 (2):243-253.
A degree-theoretic definition of the ramified analytical hierarchy.Carl G. Jockusch & Stephen G. Simpson - 1976 - Annals of Mathematical Logic 10 (1):1-32.
Bounded arithmetic for NC, ALogTIME, L and NL.P. Clote & G. Takeuti - 1992 - Annals of Pure and Applied Logic 56 (1-3):73-117.
Analytics
Added to PP
2015-12-02
Downloads
32 (#511,228)
6 months
2 (#1,240,952)
2015-12-02
Downloads
32 (#511,228)
6 months
2 (#1,240,952)
Historical graph of downloads
Citations of this work
Infinite games specified by 2-tape automata.Olivier Finkel - 2016 - Annals of Pure and Applied Logic 167 (12):1184-1212.
Locally finite ω‐languages and effective analytic sets have the same topological complexity.Olivier Finkel - 2016 - Mathematical Logic Quarterly 62 (4-5):303-318.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-747975fc64-ttfh4 uwo