On \(\mathsf{Q}\)
type: Item
instance of: scholarly article
title: On \(\mathsf{Q}\)
zbMATH Open document ID: 1420.03143
author: Albert Visser
published in: Soft Computing
publication date: 2018-02-23T00:00:00Z
Mathematics Subject Classification ID: 03F30
zbMATH DE Number: 6843087
zbMATH Keywords: \(\mathsf{Q}\)
zbMATH Keywords: \(\mathsf{PA}^-\)
zbMATH Keywords: arithmetic
zbMATH Keywords: weak theories
zbMATH Keywords: interpretability
zbMATH Keywords: comparison of theories
MaRDI profile type: Publication
full work available at URL: s00500-016-2341-5
OpenAlex ID: W2914888325
cites work: Q3148848
cites work: Gödel's Second incompleteness theorem for Q
cites work: Q5625151
cites work: Sequence encoding without induction
cites work: Q5286672
cites work: Variants of Robinson's essentially undecidable theoryR
cites work: Q4001935
cites work: A lattice of chapters of mathematics (interpretations between theorems [theories])
cites work: Q4726219
cites work: The sum of irreducible fractions with consecutive denominators is never an integer in \(\mathrm{PA}^-\)
cites work: The Green-Tao theorem on primes in arithmetical progressions in the positive cone of \(\mathbb Z [X]\)
cites work: Schatunowsky's theorem, Bonse's inequality, and Chebyshev's theorem in weak fragments of Peano arithmetic
cites work: Deduction-preserving "Recursive Isomorphisms" between theories
cites work: Some Prime Elements in the Lattice of Interpretability Types
cites work: Cuts, consistency statements and interpretations
cites work: Sequential theories and infinite distributivity in the lattice of chapters
cites work: Q5445176
cites work: Undecidable theories
cites work: Q5567863
cites work: Pairs, sets and sequences in first-order theories
cites work: Vaught's theorem on axiomatizability by a scheme
cites work: Q5222085
cites work: Interpretability degrees of finitely axiomatized sequential theories
cites work: Q3464615
DOI: 10.1007/S00500-016-2341-5
description: scientific article; zbMATH DE number 6843087