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

Studia Logica 38 (1):49 - 73 (1979)
Abstract
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.1007/BF00493672
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 35,865
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

A Game-Based Formal System for Ł∞.Alan Adamson & Robin Giles - 1979 - Studia Logica 38 (1):49-73.
Game Logic and its Applications I.Mamoru Kaneko & Takashi Nagashima - 1996 - Studia Logica 57 (2-3):325 - 354.
On Scott and Karp Trees of Uncountable Models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
The 3-Stratifiable Theorems of $\Mathit{NFU}_\Infty$.Marcel Crabbé - 1999 - Notre Dame Journal of Formal Logic 40 (2):174-182.

Analytics

Added to PP index
2011-05-29

Total downloads
8 ( #599,841 of 2,293,801 )

Recent downloads (6 months)
3 ( #182,547 of 2,293,801 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature