Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
20
views
12
references
Top references
cited by
7
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,631
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Science Logic
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
other
Author(s):
Alexander Rabinovich
,
Wolfgang Thomas
Publication date
(Print):
2006
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Radiology and Natural Language Processing
Most cited references
12
Record
: found
Abstract
: not found
Book Chapter
: not found
Languages, Automata, and Logic
Wolfgang Thomas
(1997)
0
comments
Cited
147
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The Monadic Theory of Order
Saharon Shelah
(1975)
0
comments
Cited
42
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Finite Automata, Formal Logic, and Circuit Complexity
Howard Straubing
(1994)
0
comments
Cited
29
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 562-574
DOI:
10.1007/11874683_37
SO-VID:
10848fb8-b1aa-4e95-a2b4-f35def3551c1
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 591
Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
pp. 167
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
pp. 287
Algorithms for Omega-Regular Games with Imperfect Information
pp. 334
First-Order Queries over One Unary Function
pp. 349
Infinite State Model-Checking of Propositional Dynamic Logics
pp. 395
Solving Games Without Determinization
pp. 562
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Similar content
2,631
Extended Unary Coding
Authors:
Subhash Kak
Memoization for Unary Logic Programming: Characterizing PTIME
Authors:
Clément Aubert
,
Marc Bagnol
,
Thomas Seiller
PCG-inexact Newton methods for unary optimization
Authors:
Jianzhong Zhang
,
Yi Xue
,
Ping Zhong
…
See all similar
Cited by
7
A Myhill-Nerode theorem for automata with advice
Authors:
Ben Zax
,
Alex Kruckman
,
Sasha Rubin
…
Monadic Second-Order Logic with Arbitrary Monadic Predicates
Authors:
Nathanaël Fijalkow
,
Charles Paperman
The Church Synthesis Problem with Parameters
Authors:
See all cited by