相关论文: Logic Blog 2016
In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, and monadic second-order logic.
Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this paper, we prove that if $\sigma_1(G)<2+\frac{11}{|G|}$\,, then $G$ is supersolvable. In particular, some new characterizations of the well-known groups…
Large language models (LLMs) typically employ greedy decoding or low-temperature sampling for reasoning tasks, reflecting a perceived trade-off between diversity and accuracy. We challenge this convention by introducing top-$n\sigma$, a…
Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…
The complete one-loop, planar dilatation operator of the N=4 superconformal gauge theory was recently derived and shown to be integrable. Here, we present further compelling evidence for a generalisation of this integrable structure to…
A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…
We prove undecidability for every positive relevant logic extending the system axiomatized by hypothetical syllogism, prefixing, and suffixing and contained in the logic of the semilattice frame $(P_{\mathrm{fin}}(\mathbb{N}), \cup,…
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…
Upper bound limit analysis allows one to evaluate directly the ultimate load of structures without performing a cumbersome incremental analysis. In order to numerically apply this method to thin plates in bending, several authors have…
Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computation of probabilities and for reasoning about probabilities,…
Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…
We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…
This introduction begins with a section on fundamental notions of mathematical logic, including propositional logic, predicate or first-order logic, completeness, compactness, the L\"owenheim-Skolem theorem, Craig interpolation, Beth's…
Quantitative logic reasons about the degree to which formulas are satisfied. This paper studies the fundamental reasoning principles of higher-order quantitative logic and their application to reasoning about probabilistic programs and…
We provide new proofs of two key results of p-adic Hodge theory: the Fontaine-Wintenberger isomorphism between Galois groups in characteristic 0 and characteristic p, and the Cherbonnier-Colmez theorem on decompletion of (phi,…
Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are "reasonably…
This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while causal Bayes nets serve as a probabilistic foundation. We give…
We give an affirmative answer to the question whether there exist Lie algebras for suitable closed subgroups of the unitary group $U(\mathcal{H})$ in a Hilbert space $\mathcal{H}$ with $U(\mathcal{H})$ equipped with the strong operator…
In CSL'99 Roversi pointed out that the Turing machine encoding of Girard's seminal paper "Light Linear Logic" has a flaw. Moreover he presented a working version of the encoding in Light Affine Logic, but not in Light Linear Logic. In this…