Computational Issues in Calculi of Partial Inductive Definitions

Computational Issues in Calculi of Partial Inductive Definitions

We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute...

Full description

Bibliographic Details
Main Author: Kreuger, Per
Format: Doctoral Thesis
Language:English
Published: Decisions, Networks and Analytics lab 1995
Subjects:
Theory of computation
algorithms
logic
proof-theory
partial inductive defi-nitions
definitional reflection
disunification
closure
completion
negation
constructive negation
quantification
logic programming
meta programming
skolemization
self-reference
program semantics
declarative control
proof-search
theorem-proving.
Computer and Information Science
Data- och informationsvetenskap
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-21196

Internet

http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-21196

Similar Items