- 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
Word automaticity of tree automatic scattered linear orderings is decidable
In S. Barry Cooper (ed.), How the World Computes. pp. 313--322 (2012)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
Countably categorical coloured linear orders.Feresiano Mwesigye & John K. Truss - 2010 - Mathematical Logic Quarterly 56 (2):159-163.
An Undecidable Linear Order That Is $n$-Decidable for All $n$.John Chisholm & Michael Moses - 1998 - Notre Dame Journal of Formal Logic 39 (4):519-526.
On the equimorphism types of linear orderings.Antonio Montalbán - 2007 - Bulletin of Symbolic Logic 13 (1):71-99.
Automatic structures of bounded degree revisited.Dietrich Kuske & Markus Lohrey - 2011 - Journal of Symbolic Logic 76 (4):1352-1380.
First-order and counting theories of ω-automatic structures.Dietrich Kuske & Markus Lohrey - 2008 - Journal of Symbolic Logic 73 (1):129-150.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Mental Action and the Threat of Automaticity.Wayne Wu - 2013 - In Andy Clark, Julian Kiverstein & Tillman Vierkant (eds.), Decomposing the Will. Oxford University Press. pp. 244-61.
Ethical Automaticity.Michael Brownstein & Alex Madva - 2012 - Philosophy of the Social Sciences 42 (1):68-98.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
A coding of the countable linear orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
Analytics
Added to PP
2014-01-28
Downloads
7 (#1,351,854)
6 months
2 (#1,263,261)
2014-01-28
Downloads
7 (#1,351,854)
6 months
2 (#1,263,261)
Historical graph of downloads
Citations of this work
Tree-automatic well-founded trees.Alexander Kartzow, Jiamou Liu & Markus Lohrey - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 363--373.
References found in this work
Automata presenting structures: A survey of the finite string case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
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-7c76586df8-5tf24 uwo