Uniformisation of regular relations in first-order logic with two variables
From MaRDI portal
Cites work
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- Choice functions and well-orderings over the infinite binary tree
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Facets of Synthesis: Revisiting Church’s Problem
- scientific article; zbMATH DE number 6680130 (Why is no real title available?)
- scientific article; zbMATH DE number 1775408 (Why is no real title available?)
- scientific article; zbMATH DE number 2087227 (Why is no real title available?)
- MSO on the Infinite Binary Tree: Choice and Order
- On finite monoids having only trivial subgroups
- Rabin's uniformization problem
- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
- Separating regular languages by piecewise testable and unambiguous languages
- Solving Sequential Conditions by Finite-State Strategies
- Structure Theorem and Strict Alternation Hierarchy for FO2 on Words
- The recursive sets in certain monadic second order fragments of arithmetic
- Uniformisations of regular relations over bi-infinite words
- Uniformization problem for variants of first order logic over finite words
This page was built for publication: Uniformisation of regular relations in first-order logic with two variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970219)