Related papers: Elements of affine model theory
Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of…
We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…
Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this paper, we will survey the use of structural proof theory as an alternative foundation. Researchers have been using…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
We characterize exactly the compactness properties of the product of \kappa\ copies of the space \omega\ with the discrete topology. The characterization involves uniform ultrafilters, infinitary languages, and the existence of nonstandard…
To each category C of modules of finite length over a complex simple Lie algebra g, closed under tensoring with finite dimensional modules, we associate and study a category Aff(C)_\kappa of smooth modules (in the sense of Kazhdan and…
We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) two-variable logic as well…
We classify complex compact parallelizable manifolds which admit flat torsion free holomorphic affine connections. We exhibit complex compact manifolds admitting holomorphic affine connections, but no flat torsion free holomorphic affine…
This article re-examines Lawvere's abstract, category-theoretic proof of the fixed-point theorem whose contrapositive is a `universal' diagonal argument. The main result is that the necessary axioms for both the fixed-point theorem and the…
We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…
We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…
Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…
How can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give a step towards this question, taking a logical model-theoretic approach to the analysis of complexity in fuzzy constraint…
Large language models exhibit systematic limitations in structured logical reasoning: they conflate hypothesis generation with verification, cannot distinguish conjecture from validated knowledge, and allow weak reasoning steps to propagate…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…
The multiplicative fragment of Linear Logic is the formal system in this family with the best understood proof theory, and the categorical models which best capture this theory are the fully complete ones. We demonstrate how the Hyland-Tan…
The multi-valued logic of {\L}ukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation, [DNE]. However, our…
We apply some tools developed in categorical logic to give an abstract description of constructions used to formalize constructive mathematics in foundations based on intensional type theory. The key concept we employ is that of a Lawvere…
Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…