Nondeterministic and nonconcurrent computational semantics for BB+ and related logics

Journal of Logic and Computation:1-20 (forthcoming)
  Copy   BIBTEX

Abstract

In this paper, we provide a semantics for a range of positive substructural logics, including both logics with and logics without modal connectives. The semantics is novel insofar as it is meant to explicitly capture the computational flavor of these logics, and to do so in a way that builds in both nondeterministic and nonconcurrent computational processes.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Kripke bundle semantics and c-set semantics.Eiko Isoda - 1997 - Studia Logica 58 (3):395-401.
The handbook of contemporary semantic theory.Shalom Lappin (ed.) - 1996 - Cambridge, Mass., USA: Blackwell Reference.
Algebraic Kripke-Style Semantics for Relevance Logics.Eunsuk Yang - 2014 - Journal of Philosophical Logic 43 (4):803-826.
Star models and the semantics of infectiousness.Matthew W. G. McClure - 2020 - Undergraduate Philosophy Journal of Australasia 2 (2):35–57.
Davidson's Semantics and Computational Understanding of Language.Damjan Bojadžiev - 1989 - Grazer Philosophische Studien 36 (1):133-139.
Davidson's Semantics and Computational Understanding of Language.Damjan Bojadžiev - 1989 - Grazer Philosophische Studien 36 (1):133-139.

Analytics

Added to PP
2023-09-20

Downloads
117 (#151,137)

6 months
78 (#59,831)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Shay Logan
Kansas State University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references