Results 1 to 10 of about 582,695 (345)
The Fluted Fragment with Transitive Relations [PDF]
We study the satisfiability problem for the fluted fragment extended with transitive relations. The logic enjoys the finite model property when only one transitive relation is available and the finite model property is lost when additionally either equality or a second transitive relation is allowed.
Pratt-Hartmann, Ian, Tendera, Lidia
arxiv +7 more sources
The extended permutohedron on a transitive binary relation [PDF]
For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e.
Luigi Santocanale, Friedrich Wehrung
core +9 more sources
Maximal and maximum transitive relation contained in a given binary relation [PDF]
We study the problem of finding a \textit{maximal} transitive relation contained in a given binary relation. Given a binary relation of size $m$ defined on a set of size $n$, we present a polynomial time algorithm that finds a maximal transitive sub-relation in time $O(n^2 + nm)$.
Sourav Chakraborty+3 more
arxiv +3 more sources
Tableaux for multi-modal hybrid logic with binders, transitive relations and relation hierarchies [PDF]
In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal logic with transitive relations and relation inclusion assertions.
Marta Cialdea Mayer
arxiv +3 more sources
Extension of Rough Set Based on Positive Transitive Relation [PDF]
The application of rough set theory in incomplete information systems is a key problem in practice since missing values almost always occur in knowledge acquisition due to the error of data measuring, the limitation of data collection, or the limitation of data comprehension, etc.
Min Shu, Wei Zhu
arxiv +3 more sources
Embedding an analytic equivalence relation in the transitive closure of a Borel relation [PDF]
The transitive closure of a reflexive, symmetric, analytic relation is an analytic equivalence relation. Does some smaller class contain the transitive closure of every reflexive, symmetric, closed relation? An essentially negative answer is provided here.
Edward J. Green
arxiv +2 more sources
The role of memory in affirming-the-consequent fallacy [PDF]
Summary: People tend to recognize that a transitive relation remains true even when its order is reversed. This affirming-the-consequent fallacy is thought to be uniquely related to human intelligence.
Yoko Higuchi+4 more
doaj +2 more sources
Transitivity of the εm-relation on (m-idempotent) hyperrings
On a general hyperring, there is a fundamental relation, denoted γ*, such that the quotient set is a classical ring. In a previous paper, the authors defined the relation εm on general hyperrings, proving that its transitive closure εm∗$\begin{array}{} \
Norouzi Morteza, Cristea Irina
doaj +3 more sources
We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation.
Ian Pratt‐Hartmann
openalex +4 more sources
Scott-topology based on transitive binary relation [PDF]
In the study of partially ordered sets, topologies such as Scott-topology have shown to be of paramount importance. In order to have analogous topology-like tools in the more general setting of quantitative domains, we introduce a method to construct ...
Osama Sayed, Nabil Hassan Sayed
doaj +1 more source