Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic
From MaRDI portal
Publication:4372922
DOI10.2307/421147zbMath0897.03002OpenAlexW2035260565MaRDI QIDQ4372922
Publication date: 11 October 1998
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0303-toc.htm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Unnamed Item ⋮ An analysis of Lambek's production machines ⋮ A modular and parameterized presentation of pregroup calculus ⋮ Pregroup Grammars, Their Syntax and Semantics
Cites Work
- Unnamed Item
- Unnamed Item
- Linear logic
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The system \({\mathcal F}\) of variable types, fifteen years later
- A small complete category
- Pre-recursive categories
- On completeness and cocompleteness in and around small categories
- General recursive functions of natural numbers
- The Mathematics of Sentence Structure
- On certain formal properties of grammars
- How to Program an Infinite Abacus
- The theory of recursive functions, approaching its centennial
- Adjointness in Foundations
- Functional completeness of cartesian categories
- An Informal Arithmetical Approach to Computability and Computation
- Computability of Recursive Functions
- Finite combinatory processes—formulation
- Correction to A note on the Entscheidungsproblem
- A formulation of the simple theory of types
- The completeness of the first-order functional calculus
- Formal Reductions of the General Combinatorial Decision Problem
This page was built for publication: Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic
