Storing and simplifying propositions in predicate calculus. This is version 1.
-
-
What This Module Does - An overview of the calculus module's role and abilities. -
How To Include This Module - What to do to make use of the calculus module in a new command-line tool. -
Introduction to Predicate Calculus - An exposition of the form of predicate calculus used by Inform.
-
-
-
Calculus Module - Setting up the use of this module.
-
-
-
Compilation Schemas - To create, and later expand upon, short prototypes of I6 syntax for such run-time tasks as the setting, unsetting or testing of a relation. -
Unary Predicates - A lightweight structure to represent a unary predicate, which is either true or false when applied to a single term. -
Unary Predicate Families - To create sets of unary predicates for different purposes. -
Kind Predicates - To define the predicates for membership of a kind. -
The Adjectival Predicates - To define the predicates connected to limguistic adjectives. -
The Creation Predicates - To define the predicates causing instances to be created. -
Everywhere, Nowhere and Here - To define the unary predicates for some anaphoric location adjectives. -
Binary Predicate Families - To create sets of relations for different purposes. -
Binary Predicates - To create and manage binary predicates, which are the underlying data structures beneath Inform's relations. -
The Equality Relation - To define that prince among predicates, the equality relation.
-
-
-
Terms - Terms are the representations of values in predicate calculus: variables, constants or functions of other terms. -
Atomic Propositions - To build and modify atoms, the syntactic pieces from which propositions are built up. -
Propositions - To build and modify structures representing propositions in predicate calculus. -
Binding and Substitution - To substitute constants into propositions in place of variables, and to apply quantifiers to bind any unbound variables. -
Type Check Propositions - Predicate calculus is a largely symbolic exercise, and its rules of working tend to assume that all predicates are meaningful for all terms: this means, for instance, that "if blue is 14" is likely to make a well-formed sentence in predicate calculus. In this section we reject such propositions on the grounds that they violate type-checking requirements on relations -- in this example, the equality relation. -
Simplifications - A set of operations each of which takes a proposition and either leaves it unchanged or replaces it with a simpler one logically equivalent to the original. -
Sentence Conversions - The third of the three sources of propositions to conjure with: those which arise by the parsing of complex sentence trees in the S-grammar.
-
Powered by Inweb.