Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees (Q3731598): Difference between revisions

Latest revision as of 14:19, 17 June 2024

scientific article

Language	Label	Description	Also known as
English	Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees	scientific article

Statements

instance of

scholarly article

0 references

title

Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees (English)

0 references

author

Stephen G. Simpson

0 references

published in

Archiv für Mathematische Logik und Grundlagenforschung

0 references

publication date

1985

0 references

full work available at URL

https://eudml.org/doc/138037

0 references

zbMATH Keywords

fragments of second order arithmetic

0 references

embeddability properties of finite trees

0 references

ordinal notations

0 references

Kruskal's theorem

0 references

ordinal analysis

0 references

formal independence results

0 references

proof theory

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A new system of proof-theoretic ordinal functions

0 references

Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies

0 references

Q3690813

0 references

Q4040375

0 references

Systems of predicative analysis

0 references

Countable algebra and set existence axioms

0 references

Ordering by Divisibility in Abstract Algebras

0 references

ϱ-inaccessible ordinals, collapsing functions and a recursive notation system

0 references

The strength of admissibility without foundation

0 references

Accessible Independence Results for Peano Arithmetic

0 references

Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

0 references

Well-quasi-orderings and sets of finite sequences

0 references

Wohlquasigeordnete Klassen endlicher Graphen

0 references

Q5734436

0 references

On the role of Ramsey quantifiers in first order arithmetic

0 references

Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?

0 references

Q3395521

0 references

Ordinal diagrams

0 references

Two Applications of Logic to Mathematics

0 references

Identifiers

zbMATH Open document ID

0598.03045

0 references

DOI

10.1007/BF02007556

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3731598

@@ Property / cites work @@
+A new system of proof-theoretic ordinal functions
@@ Property / cites work: A new system of proof-theoretic ordinal functions / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
+Normal rank
@@ Property / cites work @@
+Q3690813
@@ Property / cites work: Q3690813 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040375
@@ Property / cites work: Q4040375 / rank @@
+Normal rank
@@ Property / cites work @@
+Systems of predicative analysis
@@ Property / cites work: Systems of predicative analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Countable algebra and set existence axioms
@@ Property / cites work: Countable algebra and set existence axioms / rank @@
+Normal rank
@@ Property / cites work @@
+Ordering by Divisibility in Abstract Algebras
@@ Property / cites work: Ordering by Divisibility in Abstract Algebras / rank @@
+Normal rank
@@ Property / cites work @@
+ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
+Normal rank
@@ Property / cites work @@
+The strength of admissibility without foundation
@@ Property / cites work: The strength of admissibility without foundation / rank @@
+Normal rank
@@ Property / cites work @@
+Accessible Independence Results for Peano Arithmetic
+Normal rank
@@ Property / cites work @@
+Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
+Normal rank
@@ Property / cites work @@
+Well-quasi-orderings and sets of finite sequences
@@ Property / cites work: Well-quasi-orderings and sets of finite sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Wohlquasigeordnete Klassen endlicher Graphen
@@ Property / cites work: Wohlquasigeordnete Klassen endlicher Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Q5734436
@@ Property / cites work: Q5734436 / rank @@
+Normal rank
@@ Property / cites work @@
+On the role of Ramsey quantifiers in first order arithmetic
+Normal rank
@@ Property / cites work @@
+Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
+Normal rank
@@ Property / cites work @@
+Q3395521
@@ Property / cites work: Q3395521 / rank @@
+Normal rank
@@ Property / cites work @@
+Ordinal diagrams
@@ Property / cites work: Ordinal diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Two Applications of Logic to Mathematics
@@ Property / cites work: Two Applications of Logic to Mathematics / rank @@
+Normal rank