- https://doi.org/10.1007/s11083-025-09723-y
N-free Posets and Orthomodularity
Translate Article 
Abstract We prove that the incomparability orthoset of a finite poset is Dacey if and only if the poset is N-free. We give a characterization of finite posets with compatible incomparability orthosets.
- Research Article
8 - 10.2168/lmcs-11(4:2)2015
- Oct 15, 2015
- Logical Methods in Computer Science
In this paper we study the logical aspects of branching automata, as defined by Lodaya and Weil. We first prove that the class of languages of finite N-free posets recognized by branching automata is closed under complementation. Then we define a logic, named P-MSO as it is a extension of monadic second-order logic with Presburger arithmetic, and show that it is precisely as expressive as branching automata. As a consequence of the effectiveness of the construction of one formalism from the other, the P-MSO theory of the class of all finite N-free posets is decidable.
- Book Chapter
- 2
- 10.1007/978-3-642-40313-2_13
- Jan 1, 2013
The first result presented in this paper is the closure under complementation of the class of languages of finite N-free posets recognized by branching automata. Relying on this, we propose a logic, named Presburger-MSO or P-MSO for short, precisely as expressive as branching automata. The P-MSO theory of the class of all finite N-free posets is decidable.
- Research Article
- 1
- 10.4153/cmb-2016-036-8
- Mar 1, 2017
- Canadian Mathematical Bulletin
Let P be a finite N-free poset. We consider the hypergraph H(P) whose vertices are the elements of P and whose edges are the maximal intervals of P. We study the dual König property of H(P) in two subclasses of N-free class.
Save Important notes in documents
Highlight text to save as a note, or write notes directly
You can also access these Documents in Paperpal, our AI writing tool
Powered by our AI Writing Assistant
