A proof-theoretic characterization of the primitive recursive set functions

1992 ◽  
Vol 57 (3) ◽  
pp. 954-969 ◽  
Author(s):  
Michael Rathjen

AbstractLet KP− be the theory resulting from Kripke-Platek set theory by restricting Foundation to Set Foundation. Let G: V → V (V ≔ universe of sets) be a Δ0-definable set function, i.e. there is a Δ0-formula φ(x, y) such that φ(x, G(x)) is true for all sets x, and V ⊨ ∀x∃!yφ(x, y). In this paper we shall verify (by elementary proof-theoretic methods) that the collection of set functions primitive recursive in G coincides with the collection of those functions which are Σ1-definable in KP− + Σ1-Foundation + ∀x∃!yφ(x, y). Moreover, we show that this is still true if one adds Π1-Foundation or a weak version of Δ0-Dependent Choices to the latter theory.

2016 ◽  
Vol 81 (2) ◽  
pp. 605-628 ◽  
Author(s):  
SEAN WALSH

AbstractFrege’sGrundgesetzewas one of the 19th century forerunners to contemporary set theory which was plagued by the Russell paradox. In recent years, it has been shown that subsystems of theGrundgesetzeformed by restricting the comprehension schema are consistent. One aim of this paper is to ascertain how much set theory can be developed within these consistent fragments of theGrundgesetze, and our main theorem (Theorem 2.9) shows that there is a model of a fragment of theGrundgesetzewhich defines a model of all the axioms of Zermelo–Fraenkel set theory with the exception of the power set axiom. The proof of this result appeals to Gödel’s constructible universe of sets and to Kripke and Platek’s idea of the projectum, as well as to a weak version of uniformization (which does not involve knowledge of Jensen’s fine structure theory). The axioms of theGrundgesetzeare examples ofabstraction principles, and the other primary aim of this paper is to articulate a sufficient condition for the consistency of abstraction principles with limited amounts of comprehension (Theorem 3.5). As an application, we resolve an analogue of the joint consistency problem in the predicative setting.


Author(s):  
P. Ara ◽  
E. Pardo

AbstractIn Hazrat gave a K-theoretic invariant for Leavitt path algebras as graded algebras. Hazrat conjectured that this invariant classifies Leavitt path algebras up to graded isomorphism, and proved the conjecture in some cases. In this paper, we prove that a weak version of the conjecture holds for all finite essential graphs.


1994 ◽  
Vol 59 (4) ◽  
pp. 1274-1284 ◽  
Author(s):  
Gaisi Takeuti

A proof-theoretic characterization of the primitive recursive functions is the Σ1-definable functions in IΣ1 as is shown in Mints [4], Parsons [5], and [8].Then what is a proof-theoretic characterization of Grzegorzyk's hierarchy? First we discuss a related previous work. In Clote and Takeuti [2], we introduced a theory TAC that corresponds to the computational complexity class AC. TAC has a very weak form of induction. We assign a rank to a proof in TAC in the following way. The rank of a proof P in TAC is the nesting number of inductions used in P. Then TACi is defined to be the subtheory of TAC whose proof has a rank ≤ i. We proved that TACi corresponds to the class ACi.In this paper we introduce a theory IepΣ1 which is equivalent to IΣ1. Then we define the rank of a proof in IepΣ1 as the nesting number of inductions in the proof and prove that the proofs with rank ≤ i correspond to Grzegorcyk's hierarchy for i > 0.We also prove that the system that has proofs with rank 0 is actually equivalent to I Δ0. These facts are interesting since it is proved in [10] that the theory isomorphic to TAC∘ by RSUV isomorphism is a conservative extension of I Δo. Therefore there is some analogy between the class AC and the primitive recursive functions.


Author(s):  
M. Ferrara ◽  
M. Trombetti

AbstractLet G be an abelian group. The aim of this short paper is to describe a way to identify pure subgroups H of G by looking only at how the subgroup lattice $$\mathcal {L}(H)$$ L ( H ) embeds in $$\mathcal {L}(G)$$ L ( G ) . It is worth noticing that all results are carried out in a local nilpotent context for a general definition of purity.


2021 ◽  
Vol 31 (3) ◽  
pp. 033107
Author(s):  
F. R. Iaconis ◽  
A. A. Jiménez Gandica ◽  
J. A. Del Punta ◽  
C. A. Delrieux ◽  
G. Gasaneo

2018 ◽  
Vol 61 (1) ◽  
pp. 166-173
Author(s):  
Cleto B. Miranda-Neto

AbstractIn this note we prove the following surprising characterization: if X ⊂ is an (embedded, non-empty, proper) algebraic variety deûned over a field k of characteristic zero, then X is a hypersurface if and only if the module of logarithmic vector fields of X is a reflexive -module. As a consequence of this result, we derive that if is a free -module, which is shown to be equivalent to the freeness of the t-th exterior power of for some (in fact, any) t ≤ n, then necessarily X is a Saito free divisor.


2011 ◽  
Vol 07 (01) ◽  
pp. 173-202
Author(s):  
ROBERT CARLS

In this article, we give a Galois-theoretic characterization of the canonical theta structure. The Galois property of the canonical theta structure translates into certain p-adic theta relations which are satisfied by the canonical theta null point of the canonical lift. As an application, we prove some 2-adic theta identities which describe the set of canonical theta null points of the canonical lifts of ordinary abelian varieties in characteristic 2. The latter theta relations are suitable for explicit canonical lifting. Using the theory of canonical theta null points, we are able to give a theoretical foundation to Mestre's point counting algorithm which is based on the computation of the generalized arithmetic geometric mean sequence.


Sign in / Sign up

Export Citation Format

Share Document