相关论文: IKT$^\omega$ and \L{}ukasiewicz-models

We show that, contrary to the commonly held view, there is a natural and optimal compactness theorem for $\mathrm{L}_{\infty\infty}$ which generalizes the usual compactness theorem for first order logic. The key to this result is the switch…

Despite the rapid advancement of Large Language Models (LLMs), uncertainty quantification in LLM generation is a persistent challenge. Although recent approaches have achieved strong performance by restricting LLMs to produce short or…

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…

This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…

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.…

We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…

Classical first-order logic is in many ways central to work in mathematics, linguistics, computer science and artificial intelligence, so it is worthwhile to define it in full detail. We present soundness and completeness proofs of a…

We in this paper show that omega regular languages are not closed under infinite union and intersection. As an attempt, we propose to add step variables and quantifiers to temporal logics to enhance the expressiveness of the underlying…

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is undecidable. This holds true regardless of whether we…

First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for…

We consider first-order definability and decidability questions over rings of integers of algebraic extensions of $\Q$, paying attention to the uniformity of definitions. The uniformity follows from the simplicity of our first-order…

First-order logic fragments mixing quantifiers, arithmetic, and uninterpreted predicates are often undecidable, as is, for instance, Presburger arithmetic extended with a single uninterpreted unary predicate. In the SMT world, difference…

In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for…

We introduce a logic modelling some aspects of the behaviour of the measurement process, in such a way that no direct mention of quantum states is made, thus avoiding the problems associated to this rather evasive notion. We then study some…

Unbounded {\L}ukasiewicz logic is a substructural logic that combines features of infinite-valued {\L}ukasiewicz logic with those of abelian logic. The logic is finitely strongly complete w.r.t.~the additive $\ell$-group on the reals…

Let $\mathcal{L}$ be a first-order two-sorted language and consider a class of $\mathcal{L}$-structures of the form $\langle M, X \rangle$ where $M$ varies among structures of the first sort, while $X$ is fixed in the second sort, and it is…

Lately, so-called "quantum" models, based on parts of the mathematics of quantum mechanics, have been developed in decision theory and cognitive sciences to account for seemingly irrational or paradoxical human judgments. We consider here…

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…