David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jonathan Jenkins Ichikawa
Jack Alan Reynolds
Learn more about PhilPapers
Notre Dame Journal of Formal Logic 41 (2):171-183 (2000)
The paper introduces a semantics for the language of propositional additive-multiplicative linear logic. It understands formulas as tasks that are to be accomplished by an agent (machine, robot) working as a slave for its master (user, environment). This semantics can claim to be a formalization of the resource philosophy associated with linear logic when resources are understood as agents accomplishing tasks. I axiomatically define a decidable logic TSKp and prove its soundness and completeness with respect to the task semantics in the following intuitive sense: iff can be accomplished by an agent who has nothing but its intelligence (that is, no physical resources or external sources of information) for accomplishing tasks.
|Keywords||tasks game semantics linear logic substructural logics|
|Categories||categorize this paper)|
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.
Citations of this work BETA
Giorgi Japaridze (2003). Introduction to Computability Logic. Annals of Pure and Applied Logic 123 (1-3):1-99.
Similar books and articles
A. A. Stoli͡ar (1984). Introduction to Elementary Mathematical Logic. Dover Publications.
L. Humberstone & D. Makinson (2012). Intuitionistic Logic and Elementary Rules. Mind 120 (480):1035-1051.
L. Eley (1972). Life-World Constitution of Propositional Logic and Elementary Predicate Logic. Philosophy and Phenomenological Research 32 (3):322-340.
Michael J. Carroll (1976). On Interpreting the S5 Propositional Calculus: An Essay in Philosophical Logic. Dissertation, University of Iowa
Anthony Shiver (2013). Propositional Logic Card Games. Teaching Philosophy 36 (1):51-58.
Ernst Zimmermann (2003). Elementary Definability and Completeness in General and Positive Modal Logic. Journal of Logic, Language and Information 12 (1):99-117.
Herman Dishkant (1980). Three Prepositional Calculi of Probability. Studia Logica 39 (1):49 - 61.
Bruno Poizat (2006). Univers Positifs. Journal of Symbolic Logic 71 (3):969 - 976.
G. Aldo Antonelli & Richmond H. Thomason (2002). Representability in Second-Order Propositional Poly-Modal Logic. Journal of Symbolic Logic 67 (3):1039-1054.
Kevin C. Klement, Propositional Logic. Internet Encyclopedia of Philosophy.
David Ellerman (2010). The Logic of Partitions: Introduction to the Dual of the Logic of Subsets. Review of Symbolic Logic 3 (2):287-350.
Alexander Bochman & Dov M. Gabbay (2012). Sequential Dynamic Logic. Journal of Logic, Language and Information 21 (3):279-298.
Valery Plisko (2009). A Survey of Propositional Realizability Logic. Bulletin of Symbolic Logic 15 (1):1-42.
Tomasz Połacik (1994). Second Order Propositional Operators Over Cantor Space. Studia Logica 53 (1):93 - 105.
Added to index2010-08-24
Total downloads13 ( #285,544 of 1,935,138 )
Recent downloads (6 months)1 ( #434,530 of 1,935,138 )
How can I increase my downloads?