A game-based formal system for ł∞
Studia Logica 38 (1):49-73 (1979)
| Abstract | A formal system for , based on a game-theoretic analysis of the ukasiewicz prepositional connectives, is defined and proved to be complete. An Herbrand theorem for the predicate calculus (a variant of some work of Mostowski) and some corollaries relating to its axiomatizability are proved. The predicate calculus with equality is also considered. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJonathan P. Seldin (2000). On the Role of Implication in Formal Logic. Journal of Symbolic Logic 65 (3):1076-1114.
Max A. Freund (2000). A Complete and Consistent Formal System for Sortals. Studia Logica 65 (3):367-381.
Zamora Bonilla & P. Jesús (2006). Science Studies and the Theory of Games. Perspectives on Science 14 (4).
M. W. Bunder (1988). Arithmetic Based on the Church Numerals in Illative Combinatory Logic. Studia Logica 47 (2):129 - 143.
Mamoru Kaneko & Takashi Nagashima (1996). Game Logic and its Applications I. Studia Logica 57 (2-3):325 - 354.
Christian G. Fermüller & George Metcalfe (2009). Giles's Game and the Proof Theory of Łukasiewicz Logic. Studia Logica 92 (1):27 - 61.
Alan Adamson & Robin Giles (1979). A Game-Based Formal System for Ł ${}_{\Infty}$. Studia Logica 38 (1):49 - 73.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #203,804 of 556,837 )Recent downloads (6 months)1 ( #64,847 of 556,837 )How can I increase my downloads? |
My notes
Discussion
