Related papers: An Intermediate Logic Contained in Medvedev's Logi…

We study a real valued propositional logic with unbounded positive and negative truth values that we call R-valued logic. Such logic slightly extends continuous propositional logic which, in turn, builds on Lukasiewicz many-valued logic.…

The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: - Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for…

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…

Four dimensional N=1 supersymmetric gauge theory with gauge group SU(N_c) and matter in the adjoint and fundamental representations gives rise to a series of fixed points with an ADE classification. The A and D series exhibit…

A first-order conditional logic is considered, with semantics given by a variant of epsilon-semantics, where p -> q means that Pr(q | p) approaches 1 super-polynomially --faster than any inverse polynomial. This type of convergence is…

In the the present contribution, we prove an Omitting Types Theorem (OTT) for an arbitrary fragment of hybriddynamic first-order logic with rigid symbols (i.e. symbols with fixed interpretations across worlds) closed under negation and…

Many logical properties are known to be undecidable for normal modal logics, with few exceptions such as consistency and coincidence with $\mathsf{K}$. This paper shows that the property of being a union-splitting in…

There is a close relation between duality in $N=2$ SUSY gauge theories and integrable models. In particular, the quantum moduli space of vacua of $N=2$ SUSY $SU(3)$ gauge theories coupled to two flavors of massless quarks in the fundamental…

We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all…

We propose an $\mathcal{N}=2$ preserving deformation that leads to the confining phase of the 3d reduction of the $D_p[SU(N)]$ Argyres-Douglas theories, referred to as $\mathbb{D}_p[SU(N)]$. This deformation incorporates monopole…

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…

The paper proposes a new knowledge representation language, called DLP<, which extends disjunctive logic programming (with strong negation) by inheritance. The addition of inheritance enhances the knowledge modeling features of the language…

In this paper, we introduce a logic based on team semantics, called FOT, whose expressive power is elementary, i.e., coincides with first-order logic both on the level of sentences and (possibly open) formulas, and we also show that a…

The prepotential of N=2* supersymmetric theories with unitary gauge groups in an Omega-background satisfies a modular anomaly equation that can be recursively solved order by order in an expansion for small mass. By requiring that S-duality…

Logic programs P and Q are strongly equivalent if, given any program R, programs P union R and Q union R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of…

Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For…

In this addendum, we give a differential form interpretation of the proof of the main theorem of arXiv:1812.02448, which gives lower bounds of the dimensions of $\pi_k(B\mathrm{Diff}(D^4,\partial))\otimes\mathbb{Q}$ in terms of the…

Description logics are knowledge representation formalisms that provide the formal underpinning of the semantic web and in particular of the $\text{OWL}$ Ontology Web Language. In this paper we investigate the expressive power of logic…

We compare the model-theoretic expressiveness of the existential fragment of Separation Logic over unrestricted relational signatures (SLR) -- with only separating conjunction as logical connective and higher-order inductive definitions,…

Showing that the Ramsey property holds for a class of finite structures can be an extremely challenging task and a slew of sophisticated methods have been proposed in literature. In this paper we propose a new strategy to show that a class…