ENTCS
2011
13 years 2 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, āComputational Complexity in Non-Turing Models of Computationā...
ENTCS
2011
13 years 2 months ago
2011
The past decade has seen a remarkable resurgence of the old programme of ļ¬nding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus...
ENTCS
2011
13 years 2 months ago
2011
ENTCS
2011
13 years 2 months ago
2011
d abstract) AndrĀ“e Joyal 1 DĀ“epartement des mathĀ“ematiques UniversitĀ“e du QuĀ“ebec `a MontrĀ“eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...
ENTCS
2011
13 years 2 months ago
2011
ENTCS
2011
13 years 2 months ago
2011
SUBSEXPL is a system originally developed to visualise reductions, simpliļ¬cations and normalisations in three important calculi of explicit substitutions and has been applied to...
ENTCS
2011
13 years 2 months ago
2011
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logicās ļ¬ner control on structural rules, i...