Frank P. Ramsey, "On a problem of formal logic," Proc. London Math. Soc. (2nd ser.) 30 (1930), 234--286. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2003) (1 citation) (Correct)
....1 ) #y n )#, where m,n 0 and # is a quantifierfree formula that does not contain function symbols. A BSR theory is a finite set of BSR sentences. The following proposition was proved by Bernays and Schonfinkel [BS28] for the case of first order logic without equality, and by Ramsey [Ram30] for the case of first order logic with equality. Proposition 22. Let # a conjunction of BSR sentences. Then there exists an integer k, bounded above by the size of #, such that # is satisfiable if and only if it has a model of cardinality at most k. An immediate consequence of Proposition 22 ....
Frank P. Ramsey. On a problem in formal logic. Proceedings of the London Mathematical Society, 30:264--286, 1930.
Graph Ramsey Theory and the Polynomial Hierarchy - Schaefer (2000) (7 citations) (Correct)
....know each other. When mathematicians were invited to larger parties they began working on the general problem: How many people do you need to have at least k people who know each other, or l people who do not know each other It is not clear, a priori, that such a number even exists. Frank Ramsey [Ram30, GRS90] showed in 1930 that the number of people needed is finite. Since then Ramsey theory has developed into an active and rich field. Looking at the party example again, we see that it could also have been phrased thus: every edgecoloring of the complete graph on six vertices K 6 in red and blue ....
Frank Plumpton Ramsey. On a Problem of Formal Logic. Proceedings of the London Mathematical Society, xxx:264--286, 1930.
Ramsey's Theorem in Stable Structures - Ensley, Grossberg (1997) (Correct)
....demonstrate bounds on the size of finite sets that assure the existence therein of sequences indiscernible with respect to a formula and how those bounds are improved by stability assumptions. 1 Introduction In his fundamental paper Frank Ramsey was interested in a problem of formal logic. See [9] and pages 18 27 of [4] He proved the result now known as (finite) Ramsey s theorem which essentially states For all k, r #, there is an n # such that however the r subsets of 1, 2, n are 2 colored, there will exist a k element subset of 1, 2, n which has ....
Frank P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. Ser. 2, 30, 1930, pages 264--286.
Large numbers, Knuth's arrow notation, and Ramsey theory - Prömel (1999) (Correct)
....with red (for knowing each other) and blue (for not knowing each other) then there must exist a monochromatic three element set (i.e. a triangle) either in color red or in color blue. This observation can be considered as the rst nontrivial Ramsey result. Why is this a iRamseyj result In 1928 Frank Plumpton Ramsey (19031930) had written a paper iOn a problem in formal logicj which was published in 1930 in the Proceedings of the London Mathematical Society. It is this paper for which he became eponymous for a part of discrete mathematics nowadays known as Ramsey theory. His object was to give a decision procedure for ....
Frank Plumpton Ramsey, On a problem for formal logic, Proc. London Math. Soc. 30 (1930), 264286.
Graph Ramsey Theory and the Polynomial Hierarchy - Schaefer (1999) (7 citations) (Correct)
....know each other. When mathematicians were invited to larger parties they began working on the general problem: How many people do you need to have at least k people who know each other, or l people who do not know each other It is not clear, a priori, that such a number even exists. Frank Ramsey [Ram30, GRS90] showed in 1930 that the number of people needed is finite. Since then Ramsey theory has developed into an active and rich field. Looking at the party example again, we see that it could also have been phrased thus: every edgecoloring of the complete graph on six vertices K 6 in red and blue ....
Frank Plumpton Ramsey. On a Problem of Formal Logic. Proceedings of the London Mathematical Society, xxx:264--286, 1930.
Program Termination - And Well Partial (Correct)
No context found.
Frank P. Ramsey, "On a problem of formal logic," Proc. London Math. Soc. (2nd ser.) 30 (1930), 234--286.
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2004) (1 citation) (Correct)
No context found.
Frank P. Ramsey. On a problem in formal logic. Proceedings of the London Mathematical Society, 30:264--286, 1930.
The Combination Problem in Automated Reasoning - Zarba (2004) (Correct)
No context found.
Frank P. Ramsey. On a problem in formal logic. Proceedings of the London Mathematical Society, 30:264--286, 1930.
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2003) (1 citation) (Correct)
No context found.
Frank P. Ramsey. On a problem in formal logic. Proceedings of the London Mathematical Society, 30:264--286, 1930. 27
Relations Between Some Cardinals In The Absence Of The Axiom .. - Halbeisen, Shelah (Correct)
No context found.
Frank P. Ramsey, On a problem of formal logic, Proceedings of the London Mathematical Society, Ser. II, vol. 30 (1929), pp. 264-286.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC