(Enter summary)
Abstract: The present paper characterizes classes of distributive lattices whose
monadic, monadic chain, or monadic antichain theory are decidable.
Mathematics Subject Classication (2000): 06D99, 03B25
1 Introduction
The elementary theory of a nite distributive lattice can easily be interpreted in
the monadic second order theory of its join irreducible elements. Therefore, the
decidability of the monadic second order theory of the join irreducible elements
implies that of the elementary theory of... (Update)
Similar documents based on text: More All
0.6: The Structure of the Models of Decidable Monadic Theories of Graphs - Seese (1991)
(Correct)
0.6: Second Order Logic, Generalized Quantifiers and Decidability - Seese (1977)
(Correct)
0.3: On the Number of Distributive Lattices - Erné, Heitzig, Reinhold (2002)
(Correct)
BibTeX entry: (Update)
@misc{ kuske-distributive,
author = "Dietrich Kuske",
title = "Distributive Lattices With a Decidable Monadic Second Order Theory",
url = "citeseer.ist.psu.edu/kuske00distributive.html" }
Citations (may not include all citations):
108
A decomposition theorem for partially ordered sets (context) - Dilworth - 1950
78
a problem of formal logic (context) - Ramsey - 1930
41
The monadic theory of order (context) - Shelah - 1975
36
Monadic second-order theories (context) - Gurevich - 1985
15
Decidability of the weak second-order theory of two successo.. (context) - Doner - 1965
5
The elementary theory of recursively enumerable sets (context) - Lachlan - 1968
5
The theory of successor with an extra predicate (context) - Thomas - 1978
4
The monadic second order logic of graphs II: Innite graphs o.. (context) - Courcelle - 1989
2
The rst order properties of algebraic systems (context) - Feferman, Vaught - 1959
1
Decision problem for separated distributive lattices (context) - Gurevich - 1983
Documents on the same site (http://www.mcs.le.ac.uk/~dkuske/pub-rest.html): More
Towards a language theory for infinite N-free pomsets - Kuske (2000)
(Correct)
Temporal Logic for Computations of Concurrent Automata - Droste, Kuske (1996)
(Correct)
On Rational and on Left Divisibility Monoids - Kuske (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC