A characterization of r-maximal sets.
A criterion for admissibility of inference rules in some class of S4-logics without the branching property.
A decidable -categorical theory with a non-recursive Ryll-Nardzewski function
A decision method for the recognizability of sets defined by number systems
A Decision Procedure for Certain Disjunction-free Intermediate Propositional Calculi
A Hierarchy of Automatic ω-Words having a Decidable MSO Theory
We investigate automatic presentations of ω-words. Starting points of our study are the works of Rigo and Maes, Caucal, and Carton and Thomas concerning lexicographic presentation, MSO-interpretability in algebraic trees, and the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is in a certain sense canonical. We then generalize our techniques to a hierarchy of classes of ω-words enjoying the above...
A Logic with Conditional Probability Operators
A method for random sampling of formulas of an elementary theory and statistical estimation of their deducibility equipped by a program. II. A method for statistical testing of an at random sampled formula
A new decidable Horn fragment of predicate calculus.
A note on undecidable extensions of monadic second order successor arithmetic.
A property of the solvable radical in finitely decidable varieties
It is shown that in a finitely decidable equational class, the solvable radical of any finite subdirectly irreducible member is comparable to all congruences of the irreducible if the type of the monolith is 2. In the type 1 case we establish that the centralizer of the monolith is strongly solvable.
A Propositional p-adic Probability Logic
A remark on a paper of Taimanov
Application de l'étude de certaines congruences à un problème de décidabilité
Arithmetic over the rings of all algebraic integers.
Axiomatization and undecidability results for linear betweenness relations
Axiomatizing omega and omega-op powers of words
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.
Axiomatizing omega and omega-op powers of words
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.
Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen.
Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen.