Two-variable first-order logic with equivalence closure
We consider the satisfiability and finite satisfiability problems for extensions of the two-
variable fragment of first-order logic in which an equivalence closure operator can be …
variable fragment of first-order logic in which an equivalence closure operator can be …
A double team semantics for generalized quantifiers
A Kuusisto - Journal of Logic, Language and Information, 2015 - Springer
We investigate extensions of dependence logic with generalized quantifiers. We also
introduce and investigate the notion of a generalized atom. We define a system of semantics …
introduce and investigate the notion of a generalized atom. We define a system of semantics …
Two-variable logic with counting and trees
W Charatonik, P Witkowski - ACM Transactions on Computational Logic …, 2016 - dl.acm.org
We consider the two-variable logic with counting quantifiers (C2) interpreted over finite
structures that contain two forests of ranked trees. This logic is strictly more expressive than …
structures that contain two forests of ranked trees. This logic is strictly more expressive than …
FO^ 2 with one transitive relation is decidable
W Szwast, L Tendera - 30th International Symposium on …, 2013 - drops.dagstuhl.de
We show that the satisfiability problem for the two-variable first-order logic, FO^ 2, over
transitive structures when only one relation is required to be transitive, is decidable. The …
transitive structures when only one relation is required to be transitive, is decidable. The …
On the limits of decision: the adjacent fragment of first-order logic
B Bednarczyk, D Kojelis, I Pratt-Hartmann - arXiv preprint arXiv …, 2023 - arxiv.org
We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences
of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes …
of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes …
Two-variable logic with counting and a linear order
W Charatonik, P Witkowski - Logical Methods in Computer …, 2016 - lmcs.episciences.org
We study the finite satisfiability problem for the two-variable fragment of first-order logic
extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We …
extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We …
Decidability of weak logics with deterministic transitive closure
The deterministic transitive closure operator, added to languages containing even only two
variables, allows to express many natural properties of a binary relation, including being a …
variables, allows to express many natural properties of a binary relation, including being a …
Extending two-variable logic on trees
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted
over trees was recently shown to be ExpSpace-complete. We consider two extensions of this …
over trees was recently shown to be ExpSpace-complete. We consider two extensions of this …
A novel digital lock-in amplifier with dual channels
D Wu, C Wang, H Sun, H Wang - 2009 International Asia …, 2009 - ieeexplore.ieee.org
In order to sample two channels mixing frequency signals in high speed and process them
synchronously in the system, a dual-channel, high-speed digital lock-in amplifier (LIA) that …
synchronously in the system, a dual-channel, high-speed digital lock-in amplifier (LIA) that …
On the satisfiability problem for fragments of two-variable logic with one transitive relation
W Szwast, L Tendera - Journal of Logic and Computation, 2019 - academic.oup.com
We study the satisfiability problem for two-variable first-order logic over structures with one
transitive relation. We show that the problem is decidable in 2-NExpTime for the fragment …
transitive relation. We show that the problem is decidable in 2-NExpTime for the fragment …