A Ramsey theorem in Boyer-Moore logic

DOI10.1007/BF00881917zbMATH Open0836.03031MaRDI QIDQ1904403FDOQ1904403

Authors: Kenneth Kunen 

Publication date: 20 December 1995

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Recommendations

• An Unprovable Ramsey-Type Theorem
• Independence of Ramsey theorem variants using \(\varepsilon _0\)
• Publication:3035275
• Proving Ramsey's theory by the cover set induction: A case and comparision study.
• scientific article; zbMATH DE number 65529

zbMATH Keywords

ordinalprimitive recursive arithmeticBoyer-Moore proverNqthmParis-Harrington version of Ramsey's theorem

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Cites Work

• The consistency of arithmetics
• Rapidly growing Ramsey functions
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• An Unprovable Ramsey-Type Theorem
• Another proof of the intuitionistic Ramsey theorem
• Computer theorem proving in mathematics
• Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
• Informal versus formal mathematics
• A formalised theorem in the partition calculus
• On the metamathematics of the P vs. NP question
• Some thoughts on hypercomputation
• Title not available (Why is that?)
• Independence of Ramsey theorem variants using \(\varepsilon _0\)

Uses Software

• Nuprl
• NQTHM

This page was built for publication: A Ramsey theorem in Boyer-Moore logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904403)