A Game-Based Formal System for Ł ${}_{\infty}$

Studia Logica 38 (1):49 - 73 (1979)
A formal system for Ł ${}_{\infty}$ , based on a "game-theoretic" analysis of the Łukasiewicz propositional connectives, is defined and proved to be complete. An "Herbrand theorem" for the Ł ${}_{\infty}$ 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 (categorize this paper)
DOI 10.2307/20014928
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,667
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Marcel Crabbé (1999). The 3-Stratifiable Theorems of $\Mathit{NFU}_\Infty$. Notre Dame Journal of Formal Logic 40 (2):174-182.

Monthly downloads

Sorry, there are not enough data points to plot this chart.

Added to index


Total downloads

1 ( #647,778 of 1,726,249 )

Recent downloads (6 months)


How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.