Skip to content
<title>Channels - Deciding definability in FO2( :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Deciding definability in FO2(
Search for more channels:
Similar Items: Deciding definability in FO2(
Channel Options
View Record
Explore related channels
Quick Look
On logical hierarchies within FO^2-definable languages
Quick Look
FO2(
Quick Look
Definability and Interpolation within Decidable Fixpoint Logics
Quick Look
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
Quick Look
FO Model Checking of Interval Graphs
Quick Look
Faster Existential FO Model Checking on Posets
Quick Look
Deciding Conditional Termination
Quick Look
Decidability for Sturmian words
Quick Look
Decidability of higher-order matching
Quick Look
Deciding Kleene Algebras in Coq
Quick Look
Decidability Results for the Boundedness Problem
Quick Look
Decidability Problems for Actor Systems
Quick Look
Decidable Expansions of Labelled Linear Orderings
Quick Look
The logical strength of Büchi's decidability theorem
Quick Look
Decidability for Entailments of Symbolic Heaps with Arrays
Quick Look
Deciding Equations in the Time Warp Algebra
Quick Look
A Reduced Semantics for Deciding Trace Equivalence
Quick Look
Bounded Reachability Problems are Decidable in FIFO Machines
Quick Look
Synchronizability of Communicating Finite State Machines is not Decidable
Quick Look
Craig Interpolation for Decidable First-Order Fragments
Quick Look
Decidability of extensions of Presburger arithmetic by generalised polynomials
Quick Look
Ellipses and Lambda Definability
Quick Look
Definable isomorphism problem
Quick Look
Deciding the value 1 problem for probabilistic leaktight automata
Load more items
View Record
Prev
Explore related channels
Next
