- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Computation with run time skolemisation (N-Prolog part 3)
Journal of Applied Non-Classical Logics 3 (1):93-128 (1993)
Abstract
ABSTRACT Two computation procedures are described for intuitionistic and classical logic. The first introduces Skolem functions at runtime. The second restricts unification by time stamping. For universal Horn clauses the computation is the same as Prolog.Author Profiles
Other Versions
No versions found
My notes
Similar books and articles
N-prolog and equivalence of logic programs.Nicola Olivetti & Lea Terracini - 1992 - Journal of Logic, Language and Information 1 (4):253-340.
[no title]. - unknown
How Much of One-Way Computation Is Just Thermodynamics?Janet Anders, Michal Hajdušek, Damian Markham & Vlatko Vedral - 2008 - Foundations of Physics 38 (6):506-522.
Computation, among other things, is beneath us.Selmer Bringsjord - 1994 - Minds and Machines 4 (4):469-88.
First-order theories for pure Prolog programs with negation.Robert F. Stärk - 1995 - Archive for Mathematical Logic 34 (2):113-144.
In computation, parallel is nothing, physical everything.Selmer Bringsjord - 2001 - Minds and Machines 11 (1):95-99.
Computation, Information, and the Arrow of Time.Pieter Adriaans, Peter van Emde Boas & Fnwi Illc - 2011 - In S. B. Cooper & Andrea Sorbi, Computability in Context: Computation and Logic in the Real World. World Scientific.
Direct deductive computation on discourse representation structures.Uwe Reyle & Dov M. Gabbay - 1994 - Linguistics and Philosophy 17 (4):343 - 390.
Analytics
Added to PP
2013-12-01
Downloads
79 (#724,897)
6 months
5 (#1,609,967)
2013-12-01
Downloads
79 (#724,897)
6 months
5 (#1,609,967)
Historical graph of downloads
Author Profiles
Citations of this work
Direct deductive computation on discourse representation structures.Uwe Reyle & Dov M. Gabbay - 1994 - Linguistics and Philosophy 17 (4):343 - 390.
Labelled resolution for classical and non-classical logics.D. M. Gabbay & U. Reyle - 1997 - Studia Logica 59 (2):179-216.
References found in this work
Semantical Analysis of Intuitionistic Logic I.Saul A. Kripke - 1963 - In Michael Dummett & J. N. Crossley, Formal Systems and Recursive Functions. Amsterdam: North Holland. pp. 92-130.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation