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
5
views
6
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,248
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Formal Aspects of Cognitive Processes
Using determinancy of games to eliminate quantifiers
other
Author(s):
J. Richard Buchi
Publication date
(Online):
May 24 2005
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
Genome Engineering using CRISPR
Most cited references
6
Record
: found
Abstract
: not found
Article
: not found
Axiomatic treatment of rank in infinite sets
R Rado
(1949)
0
comments
Cited
19
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Testing and generating infinite sequences by a finite automaton
Robert McNaughton
(1966)
0
comments
Cited
19
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
�ber M�glichkeiten im Relativkalk�l
Leopold L�wenheim
(1915)
0
comments
Cited
17
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1977
Publication date (Online):
May 24 2005
Pages
: 367-378
DOI:
10.1007/3-540-08442-8_104
SO-VID:
a4871543-8a04-423c-93c2-1568fe739a09
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
On a class of scheduling algorithms for multiprocessors computing systems
pp. 11
Parallel programming: An axiomatic approach
pp. 17
A Generalisation of Parikh’s Theorem in Formal Language Theory
pp. 17
New bounds on formula size
pp. 21
Semantic attributes processing in the system DELTA
pp. 14
Two classes of holographic processes realizable in the neural realm
pp. 22
Some remarks on relational composition in computational theory and practice
pp. 30
Semantics and proof theory of pascal procedures
pp. 49
IV. Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben
pp. 107
The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory
pp. 75
Parallel recursive program schemes
pp. 77
Relationship between definition and implementation of a language
pp. 53
Finite branching automata: automata theory motivated by problem solving
pp. 72
Predicate calculus feature generation
pp. 101
Formal power series and growth functions of Lindenmayer systems
pp. 102
VII. Spektralproblem und Komplexitätstheorie
pp. 102
A fundamental theorem of asynchronous parallel computation
pp. 114
On the representability of relations by deterministic and nondeterministic multi-tape automata
pp. 116
A combinatorial method for health-care districting
pp. 125
On problems solvable by successive trials
pp. 112
Some structural properties of automata defined on groups
pp. 132
On one-way Auxiliary pushdown automata
pp. 135
Serial composition of 2-way finite-state transducers and simple programs on strings
pp. 242
The structure of an operating system
pp. 153
On some models of computability of boolean functions
pp. 120
Initial algebraic semantics for non context-free languages
pp. 167
Languages over free groups
pp. 192
Syntax-Directed Description of Incremental Compilers
pp. 202
PLAND2D — Towards a Two-Dimensional Programming Language
pp. 206
The mathematics of record handling
pp. 151
Semantics of computation
pp. 186
Systems of open paths in Petri nets
pp. 194
On the largest full sub — AFL of the full AFL of context-free languages
pp. 199
On complexity of nondeterministic Turing machines computations
pp. 215
A syntactic connection between proof procedures and refutation procedures
pp. 233
A Technique for Parsing Ambiguous Languages
pp. 244
Renaming and erasing in szilard languages
pp. 171
Disjunctive languages and codes
pp. 187
Algebras of partial sequences — A tool to deal with concurrency
pp. 301
Complexity of some problems concerning L systems
pp. 252
Nondeterministically recognizable sets of languages
pp. 319
On the rationality of petri net languages
pp. 245
Embedding theorems in the algebraic theory of graph grammars
pp. 292
Complexity and normal forms of context-free languages
pp. 419
Optimisation et Planification des Reseaux de Telecommunications
pp. 256
Some "geometrical" categories associated with flowchart schemes
pp. 412
On backtracking and greatest fixpoints
pp. 302
Functorial semantics of the type free λ-βη calculus
pp. 500
On the design of programming languages including mini algol 68
pp. 509
The time and tape complexity of developmental languages
pp. 367
Using determinancy of games to eliminate quantifiers
pp. 524
Rational relations of binary trees
pp. 344
Greibach normal form complexity
pp. 411
On representation of sequential and parallel functions
pp. 445
A hierarchy of regular sequence sets
pp. 476
Maximal rectangular relations
pp. 457
Characterization of some classes of context-free languages in terms of complexity classes
pp. 736
The logic of protection
pp. 516
Empty - storage - acceptance of ω - languages
pp. 532
Recursive ω-languages
Similar content
4,248
Lots of games and little challenge – a snapshot of modern foreign language teaching in English secondary schools
Authors:
Ursula Wingate
Status of Onchocerciasis Transmission after More Than a Decade of Mass Drug Administration for Onchocerciasis and Lymphatic Filariasis Elimination in Central Nigeria: Challenges in Coordinating the Stop MDA Decision
Authors:
Darin S. Evans
,
Kal Alphonsus
,
Jon Umaru
…
Silver-catalysed double decarboxylative addition–cyclisation–elimination cascade sequence for the synthesis of quinolin-2-ones
Authors:
C. Munashe Mazodze
,
Wade F. Petersen
See all similar
Cited by
3
Logical specifications of infinite computations
Authors:
Wolfgang Thomas
,
Helmut Lescow
State-strategies for games in F σδ ∩ G δσ
Authors:
J. Büchi
20 Modal logic for games and information
Authors:
Wiebe van der Hoek
,
Marc Pauly
See all cited by