Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
20
views
11
references
Top references
cited by
10
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,008
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Science Logic
A Bounding Quantifier
other
Author(s):
Mikołaj Bojańczyk
Publication date
(Online):
September 9 2004
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
ScienceOpen Research
Most cited references
11
Record
: found
Abstract
: not found
Article
: not found
On a Problem of Formal Logic
F. Ramsey
(1930)
0
comments
Cited
256
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Reasoning about the past with two-way automata
Moshe Vardi
(1998)
0
comments
Cited
37
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Automata on Infinite Objects and Church’s Problem
Michael L. Rabin
(1972)
0
comments
Cited
30
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2004
Publication date (Online):
September 9 2004
Pages
: 41-55
DOI:
10.1007/978-3-540-30124-0_7
SO-VID:
f34d69ee-28e4-4569-95bf-5b75410747d6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 100
A General Theorem on Termination of Rewriting
pp. 26
On Nash Equilibria in Stochastic Games
pp. 41
A Bounding Quantifier
pp. 56
Parity and Exploration Games on Infinite Graphs
pp. 130
Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
pp. 160
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
pp. 325
Parameterized Model Checking of Ring-Based Message Passing Systems
Similar content
1,008
Quantifying internal medicine resident clinical experience using resident-selected primary diagnosis codes.
Authors:
Joseph Mattana
,
Howard Kerpen
,
Clifton Lee
…
Revealing the quality of movement: A meta-analysis review to quantify the thresholds to pathological variability during standing and walking.
Authors:
N. König
,
W Taylor
,
C Baumann
…
An evaluation of the effect of military service on mortality: quantifying the healthy soldier effect.
Authors:
Ruth McLaughlin
,
Lisa Nielsen
,
Michael Waller
See all similar
Cited by
10
Weak MSO with the Unbounding Quantifier
Authors:
Mikołaj Bojanczyk
Promptness in ω-Regular Automata
Authors:
Shaull Almagor
,
Yoram Hirshfeld
,
Orna Kupferman
On the Decidability of MSO+U on Infinite Trees
Authors:
Mikołaj Bojańczyk
,
Tomasz Gogacz
,
Henryk Michalewski
…
See all cited by