Related papers: A Logic of Injectivity
We prove that under some extra hypothesis, given an \'etale endomorphism of a normal irreducible Noetherian and simply connected scheme, if the endomorphism is surjective then it is injective. The additional assumption concerns the…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…
It is shown that as knowledge is structured, it comes in modules. This provides different " layers of reality ". Each layer of reality has its own distinctive inductive logic which may differ from that of the others. All this is woven…
We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…
The definition is a common form of human expert knowledge, a building block of formal science and mathematics, a foundation for database theory and is supported in various forms in many knowledge representation and formal specification…
We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…
We prove a compactness theorem in the context of Hennessy-Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Principle to be sound modulo the corresponding process…
A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…
An introduction is given to the logic of sheaves of structures and to set theoretic forcing constructions based on this logic. Using these tools, it is presented an alternative proof of the independence of the Continuum Hypothesis; which…
In this paper, the Lawson homology and morphic cohomology are defined on the Chow motives. We also define the rational coefficient Lawson homology and morphic cohomology of the Chow motives of finite quotient projective varieties. As a…
We study local consequence relations in modal extensions of product logic over Kripke models with either valued (fuzzy) or crisp accessibility relations. In both settings, we consider semantics over the full class of product algebras as…
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…
In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
We provide a complete axiomatization of modal inclusion logic - team-based modal logic extended with inclusion atoms. We review and refine an expressive completeness and normal form theorem for the logic, define a natural deduction proof…
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…
Building on our previous work on enriched universal algebra, we define a notion of enriched language consisting of function and relation symbols whose arities are objects of the base of enrichment. In this context, we construct atomic…
The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is…