Related papers: Positive Strong Amalgamation
We study the amalgamation property in positive logic. We give some connections between the amalgamation property and Robinson theories, model-complete theories and the Hausdorff property.
We introduce the notions of almost positively closed models and positive strong amalgamation property. We study the fundamental properties of these notions and develop some interactions between them.
We develop the basic model theory of local positive logic, a new logic that mixes positive logic (where negation is not allowed) and local logic (where models omit types of infinite distant pairs). We study several basic model theoretic…
In this paper we extend of the notion of algebraically closed given in the case of groups and skew fields to an arbitrary h-inductive theory. The main subject of this paper is the study of the notion of positive algebraic closedness and its…
Positive logic is a generalisation of full first-order logic that does not have negation built in. Still, many model-theoretic ideas, tools and techniques work perfectly fine in positive logic. Importantly, there is a compactness theorem.…
As an extension of positive or almost positive diagrams and links, we introduce a notion of successively almost positive diagrams and links, and good successively almost positive diagrams and links. We review various properties of positive…
The article demonstrates that logic is not necessarily singleton and does not always have the standard interpretation of negation. Appropriate generalizations of logic are suggested. Positive logic and multivalued negation operations are…
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable strictly…
With the aim of developing the concepts of positive logic and in response to a question that was asked by Poizat in one of his articles, I wrote this article. The main topic is the study of compactness in the extension as a compact…
As an approach to a Theory of Everything a framework for developing a coherent theory of mathematics and physics together is described. The main characteristic of such a theory is discussed: the theory must be valid and and sufficiently…
We proposed social synergetics and the four basic theorems, in which theorem of perfect correlation on humanity is researched mathematically. Generally, we discuss the four variables and the eight aspects in social physics. We search social…
Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…
We introduce a new "positive formalism" for encoding quantum theories in the general boundary formulation, somewhat analogous to the mixed state formalism of the standard formulation. This makes the probability interpretation more natural…
The idea of monotonicity (or positive-definiteness in the linear case) is shown to be the central theme of the solution theories associated with problems of mathematical physics. A "grand unified" setting is surveyed covering a…
The theory of total positivity for reductive groups is here extended to the case of symmetric spaces.
We present a general logical framework for reasoning about agents' cognitive attitudes of both epistemic type and motivational type. We show that it allows us to express a variety of relevant concepts for qualitative decision theory…
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…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…