On Two Notions of Computation in Transparent Intensional Logic

Axiomathes 29 (2):189-205 (2018)
  Copy   BIBTEX

Abstract

In Transparent Intensional Logic we can recognize two distinct notions of computation that loosely correspond to term rewriting and term interpretation as known from lambda calculus. Our goal will be to further explore these two notions and examine some of their properties.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,261

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Recursion theory and the lambda-calculus.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):67-83.
Two Standard and Two Modal Squares of Opposition.Jiri Raclavsky - 2016 - In Jean-Yves Béziau & Gianfranco Basti, The Square of Opposition: A Cornerstone of Thought (Studies in Universal Logic). Cham, Switzerland: Birkhäuser. pp. 119-142.
Skew confluence and the lambda calculus with letrec.Zena M. Ariola & Stefan Blom - 2002 - Annals of Pure and Applied Logic 117 (1-3):95-168.
No future.Leon Horsten & Hannes Leitgeb - 2001 - Journal of Philosophical Logic 30 (3):259-265.

Analytics

Added to PP
2018-09-15

Downloads
69 (#331,115)

6 months
7 (#619,681)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Ivo Pezlar
Czech Academy of Sciences

Citations of this work

Substitution inconsistencies in Transparent Intensional Logic.Miloš Kosterec - 2021 - Journal of Applied Non-Classical Logics 31 (3-4):355-371.
Type Polymorphism, Natural Language Semantics, and TIL.Ivo Pezlar - 2023 - Journal of Logic, Language and Information 32 (2):275-295.

Add more citations