Skip to content
<title>Channels - Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
Search for more channels:
Similar Items: Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
Channel Options
View Record
Explore related channels
Quick Look
The recursion hierarchy for PCF is strict
Quick Look
On the strictness of the quantifier structure hierarchy in first-order logic
Quick Look
On logical hierarchies within FO^2-definable languages
Quick Look
Statman's Hierarchy Theorem
Quick Look
FO2(
Quick Look
Strict Hierarchy for Quantum Channel Certification to Unitary
Quick Look
Deciding definability in FO2(
Quick Look
FO Model Checking of Interval Graphs
Quick Look
Alternating register automata on finite words and trees
Quick Look
Domain Representable Spaces Defined by Strictly Positive Induction
Quick Look
Faster Existential FO Model Checking on Posets
Quick Look
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
Quick Look
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
Quick Look
Preservation and decomposition theorems for bounded degree structures
Quick Look
A Hierarchy of Nondeterminism
Quick Look
Comparing hierarchies of total functionals
Quick Look
The Wadge Hierarchy of Deterministic Tree Languages
Quick Look
On the Monadic Second-Order Transduction Hierarchy
Quick Look
A rich hierarchy of functionals of finite types
Quick Look
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
Quick Look
On the Mints Hierarchy in First-Order Intuitionistic Logic
Quick Look
A survey on difference hierarchies of regular languages
Quick Look
Ambiguity Hierarchy of Regular Infinite Tree Languages
Quick Look
Transfinite Lyndon words
Load more items
View Record
Prev
Explore related channels
Next
