Related papers: Remarks on Primitive Regulation

A number of first-order calculi employ an explicit model representation formalism for automated reasoning and for detecting satisfiability. Many of these formalisms can represent infinite Herbrand models. The first-order fragment of…

Let $\Gamma(S)$ be the pure mapping class group of a connected orientable surface $S$ of negative Euler characteristic. For ${\mathscr C}$ a class of finite groups, let $\hat{\pi}_1(S)^{\mathscr C}$ be the pro-${\mathscr C}$ completion of…

A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…

The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…

Enochs Conjecture asserts that each covering class of modules (over any ring) has to be closed under direct limits. Although various special cases of the conjecture have been verified, the conjecture remains open in its full generality. In…

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

Let $\mathscr C$ be a class of finite and infinite graphs that is closed under induced subgraphs. The well-known {\L}o\'s-Tarski Theorem from classical model theory implies that $\mathscr C$ is definable in first-order logic (FO) by a…

G.W. Mackey's celebrated obstruction theory for projective representations of locally compact groups was remarkably generalized by J. M. G. Fell and R. S. Doran to the wide area of saturated Banach *-algebraic bundles. Analogous obstruction…

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…

In this paper we prove an $\infty$-categorical version of the reflection theorem of Ad\'amek-Rosick\'y. Namely, that a full subcategory of a presentable $\infty$-category which is closed under limits and $\kappa$-filtered colimits is a…

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

We introduce a general categorical framework for finiteness conditions that unifies classical notions such as Noetherianness, Artinianness, and various forms of topological compactness. This is achieved through the concept of…

Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

For any truncated path algebra $\Lambda$ of a quiver, we classify, by way of representation-theoretic invariants, the irreducible components of the parametrizing varieties $\mathbf{Rep}_{\mathbf{d}}(\Lambda)$ of the $\Lambda$-modules with…

The main result of this paper is to prove the existence of a finite basis in the description logic ${\cal ALC}$. We show that the set of General Concept Inclusions (GCIs) holding in a finite model has always a finite basis, i.e. these GCIs…

In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson…

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

This is a study of S. Kripke's notion of fulfilment. Motivated by Paris-Harrington statement, Kripke was looking for a proof of G\"odel's Incompleteness Theorem which was model-theoretic, natural (without self-reference), and easy.…

Let A,B,S be finite subsets of an abelian group G. Suppose that the restricted sumset C={a+b: a in A, b in B, and a-b not in S} is nonempty and some c in C can be written as a+b with a in A and b in B in at most m ways. We show that if G is…