Related papers: Solovay's completeness without fixed points

Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus,…

We introduce syntactic modal operator $\BOX$ for \textit{being a thesis} into first-order logic. This logic is a modern realization of R. Carnap's old ideas on modality, as logical necessity (J. Symb. Logic, 1946) \cite{Ca46}. We place it…

We present Generative Logic (GL), a deterministic architecture that starts from user-supplied axiomatic definitions written in a minimalist Mathematical Programming Language (MPL) and systematically explores a configurable region of their…

We investigate modal logical aspects of provability predicates $\mathrm{Pr}_T(x)$ satisfying the following condition: $\mathbf{M}$: If $T \vdash \varphi \to \psi$, then $T \vdash \mathrm{Pr}_T(\ulcorner \varphi \urcorner) \to…

Every finite non-nilpotent group can be extended by a term operation such that solving equations in the resulting algebra is NP-complete and checking identities is co-NP-complete. This result was firstly proven by Horv\'ath and Szab\'o; the…

Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…

In this short paper, I present a few theorems on sentences of arithmetic which are related to Yablo's Paradox as G\"odel's first undecidable sentence was related to the Liar paradox. In particular, I consider two different arithemetizations…

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…

We prove that in 1-D the growth of Sobolev norms for time-dependent linear Schr\"odinger equations is at most logarithmic in time for any (fixed) potential which is analytic (or Gevrey). Recently it was proven in [N] that almost surely the…

Standpoint linear temporal logic ($SLTL$) is a recently introduced extension of classical linear temporal logic ($LTL$) with standpoint modalities. Intuitively, these modalities allow to express that, from agent $a$'s standpoint, it is…

The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…

In 2002, M. A. Tsfasman and S. G. Vl\u{a}du\c{t} formulated the generalized Brauer-Siegel conjecture for asymptotically exact families of number fields. In this article, we establish this conjecture for asymptotically good towers and…

Conjecturing and theorem proving are activities at the center of mathematical practice and are difficult to separate. In this paper, we propose a framework for completing incomplete conjectures and incomplete proofs. The framework can turn…

In the first part of this article, we complete the program announced in the preliminary note [8] by proving a conjecture presented in [9] that states the equivalence of contractibility and p_{1}-stability for generalized spaces of formal…

This paper exhibits a general and uniform method to prove completeness for certain modal fixpoint logics. Given a set \Gamma of modal formulas of the form \gamma(x, p1, . . ., pn), where x occurs only positively in \gamma, the language…

This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…

Let F(X;Y) in Q[X;Y] be a Q-irreducible polynomial. In 1929 Skolem proved the following theorem: "Assume that F(0;0) = 0. Then for every non-zero integer d, the equation F(X;Y) = 0 has only finitely many solutions in integers (X;Y) with…

"[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects. This paper presents an abstract mathematical formulation of propositional…

Michael Handel proved in [7] the existence of a fixed point for an orientation preserving homeomorphism of the open unit disk that can be extended to the closed disk, provided that it has points whose orbits form an oriented cycle of links…

We prove Polya's conjecture of 1943: For a real entire function of order greater than 2, with finitely many non-real zeros, the number of non-real zeros of the n-th derivative tends to infinity with n. We use the saddle point method and…