Positive Logic: An Introduction for Model Theorists
Mark Kamsma

TL;DR
This paper introduces positive logic, a form of logic without negation, demonstrating that many classical model-theoretic results extend to it, including compactness, stability, and applications to hyperimaginaries and continuous logic.
Contribution
It provides a comprehensive introduction to positive model theory, extending key concepts like categoricity, independence, and hyperimaginaries within this negation-free framework.
Findings
Positive logic retains compactness and many classical results.
The $(-)^{ ext{heq}}$ construction works within positive logic, unlike in full first-order logic.
Continuous logic can be viewed as a special case of positive logic.
Abstract
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. With some care, many classical results hold in the generality of positive logic without giving up any strength. In these self-contained notes we give an introduction to model theory in positive logic. We give a complete treatment of the basics of positive model theory and then we move on to deeper model-theoretic concepts. First, we discuss countable categoricity, where we work towards a theorem that characterises countably categorical positive theories. After that, we briefly discuss how the convenient formalism of monster models goes through in positive logic as usual. This is helpful in the remainder of the notes, where we discuss simple and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Logic, Reasoning, and Knowledge · Computability, Logic, AI Algorithms
