Related papers: Positive Strong Amalgamation
In this paper, eventually totally positive matrices (i.e. matrices all whose powers starting with some point are totally positive) are studied. We present a new approach to eventual total positivity which is based on the theory of…
Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…
We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. We find the amalgamation bases and characterise the types over them. We…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
In this article we present and describe a notion of "logical perfection". We extract the notion of "perfection" from the contemporary logical concept of categoricity. Categoricity (in power) has become in the past half century a main driver…
We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…
It is well-known that natural axiomatic theories are pre-well-ordered by logical strength, according to various characterizations of logical strength such as consistency strength and inclusion of $\Pi^0_1$ theorems. Though these notions of…
The literature on judgment aggregation is moving from studying impossibility results regarding aggregation rules towards studying specific judgment aggregation rules. Here we give a structured list of most rules that have been proposed and…
We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly…
We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…
We study invariant theory of the general linear supergroup in positive characteristic. In particular, we determine when the symmetric group algebra acts faithfully on tensor superspace and demonstrate that the symmetric group does not…
Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…
Multi-adjoint logic programming is a general framework with interesting features, which involves other positive logic programming frameworks such as monotonic and residuated logic programming, generalized annotated logic programs, fuzzy…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
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…
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…