相关论文: Predicativity beyond Gamma_0

In Feferman's work, explicit mathematics and theories of generalized inductive definitions play a central role. One objective of this article is to describe the connections with Martin-Lof type theory and constructive Zermelo-Fraenkel set…

Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \varphi containing only bounded quantifiers, and any positive rational number \delta, decides either "\varphi…

In this note the well-ordering principle for the derivative of normal functions on ordinals is shown to be equivalent to the existence of arbitrarily large countable coded omega-models of the well-ordering principle for the function.

Ordinal analysis induces a partition of $\Sigma^1_1$-definable and $\Pi^1_1$-sound theories whereby two theories are equivalent if they have the same proof-theoretic ordinal. We show that no equivalence relation $\equiv$ is finer than the…

This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…

We deal with the distribution of the fractional parts of $p^{\lambda}$, $p$ running over the prime numbers and $\lambda$ being a fixed real number lying in the interval $(0,1)$. Roughly speaking, we study the following question: Given a…

We show that under Dickson's conjecture about the distribution of primes in the natural numbers, the theory Th(Z,+,1,0,Pr) where Pr is a predicate for the prime numbers and their negations is decidable, unstable and supersimple. This is in…

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

It is well-known that natural axiomatic theories are pre-well-ordered by logical strength, according to various characterizations of logical strength such as consistency strength and inclusion of $\Pi^0_1$ theorems. Though these notions of…

Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…

Godelian sentences of a sufficiently strong and recursively enumerable theory, constructed in Godel's 1931 groundbreaking paper on the incompleteness theorems, are unprovable if the theory is consistent; however, they could be refutable.…

In this note we study several topics related to the schema of local reflection $\mathsf{Rfn}(T)$ and its partial and relativized variants. Firstly, we introduce the principle of uniform reflection with $\Sigma_n$-definable parameters,…

We introduce higher $F$-rationality generalising $F$-rationality. We prove that a normal variety over a field of characteristic zero is $m$-rational if and only if it is $m$-$F$-rational after reduction modulo a sufficiently large prime…

We are going to prove that if the theory of a structure $\mathcal M=\langle \mathbb{N}, \Sigma \rangle$ is decidable and the standard order $<$ on natural numbers $\mathbb{N}$ is definable in $\mathcal M$, then there is a nontrivial…

Suppose $G$ is an arbitrary additively written primary abelian group with a fixed large subgroup $L$. It is shown that $G$ is (a) summable; (b) $\sigma$-summable;\break (c) a $\Sigma$-group; (d) $p^{\omega+1}$-projective only when so is…

Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the finite and the infinite model theory of these sentences. We…

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

We show that the equational theory of the structure $\langle \omega^{\omega}: (x,y)\mapsto x+y, x\mapsto \omega x \rangle $ is finitely axiomatizable and give a simple axiom schema when the domain is the set of transfinite ordinals. We give…

We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…