相关论文: Well-orders in the transfinite Japaridze algebra

Let $P$ be a classical pseudodifferential operator of complex order $m$ on an $n$-dimensional smooth manifold $\Omega_1$. For the truncation $P_\Omega$ to a smooth subset $\Omega$ there is a well-known theory of boundary value problems when…

This paper refines the main results from our previous study on sparse bounds of generalized commutators of multilinear fractional singular integral operators in \cite{CenSong2412}. The key improvements are: 1. We replace pointwise…

We look at classes of languages associated to the fragment of first-order logic B{\Sigma}1 which disallows quantifier alternations. Each class is defined by choosing the set of predicates on positions that may be used. Two key such…

We consider how changes in transfinite machine architecture can sometimes alter substantially their capabilities. We approach the subject by answering three open problems touching on: firstly differing halting time considerations for…

Let $\lambda=(\lambda_1,\lambda_2,...)$ be a \emph{partition} of $n$, a sequence of positive integers in non-increasing order with sum $n$. Let $\Omega:=\{1,...,n\}$. An ordered partition $P=(A_1,A_2,...)$ of $\Omega$ has \emph{type}…

We prove the uniform interpolation theorem in modal provability logics GL and Grz by a proof-theoretical method, using analytical and terminating sequent calculi for the logics. The calculus for G\"odel-L\"ob's logic GL is a variant of the…

This paper addresses the longstanding problem of determining the structure of the $\leq_{\mathrm{LT}}$-order in the Effective Topos, known to effectively embed the Turing degrees. In a surprising discovery, we show that the…

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

For those of us who generally live in the world of syntax, semantic proof techniques such as reducibility, realizability or logical relations seem somewhat magical despite -- or perhaps due to -- their seemingly unreasonable effectiveness.…

In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Let $\Pi$ be the fundamental group of a smooth variety X over $F_p$. Given a non-Archimedean place $\lambda$ of the field of algebraic numbers which is prime to p, consider the $\lambda$-adic pro-semisimple completion of $\Pi$ as an object…

Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi involving named bound variables (as opposed to de-Bruijn indices). In…

Let $E$ be a sublattice of a vector lattice $F$. $\left( x_\alpha \right)\subseteq E$ is said to be $ F $-order convergent to a vector $ x $ (in symbols $ x_\alpha \xrightarrow{Fo} x $), whenever there exists another net $…

In this paper we show that the existence of omega-models of bar induction is equivalent to the principle saying that applying the Howard-Bachmann operation to any well-ordering yields again a well-ordering.