On a Problem of Formal Logic

  title={On a Problem of Formal Logic},
  author={F. Ramsey},
  journal={Proceedings of The London Mathematical Society},
  • F. Ramsey
  • Computer Science
  • Proceedings of The London Mathematical Society
This paper is primarily concerned with a special case of one of the leading problems of mathematical logic, the problem of finding a regular procedure to determine the truth or falsity of any given logical formula*. But in the course of this investigation it is necessary to use certain theorems on combinations which have an independent interest and are most conveniently set out by themselves beforehand. 
1,883 Citations
Fundamentals of Computation Theory
Weak choice principles
  • 5
  • PDF
Decision Problems in Predicate Logic
  • 25
Computational aspects of satisfiability in probability logic
  • 1
  • PDF
Relations Between Some Cardinals in the Absence of the Axiom of Choice
  • 15
  • PDF
On the Spectra of Universal Relational Sentences
  • H. Friedman
  • Computer Science, Mathematics
  • Inf. Control.
  • 1984
  • 1
Sets, Logic, and Computation
  • 1
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics
  • 2
  • PDF