Go backward to C Logic Evaluator DefinitionsGo up to TopGo forward to Footnotes

Index

• Absolute Value
• absolute value
• abstraction
• Ackerman's function
• ancestor
• antisymmetric
• Antisymmetric
• antisymmetry
• arcs
• arguments
• arithmetic sequence
• arithmetic series
• arity
• assignment
• Associativity of Function Composition
• Asymptotic Classes
• Asymptotic of Polynomial Sequences
• asymptotically dominates
• atomic formula
• Atomic Formula
• attributes
• axioms
• Backus Naur Form
• base formula
• base term
• Big O Quantor
• bijective
• binary
• binomial coefficient
• Binomial Coefficient
• Binomial Identities
• blocks
• BNF
• Boolean value
• bottom up
• bound
• Bounds and Limits
• cardinality
• Cartesian coordinates
• Cartesian Product
• Cartesian Product
• Cauchy-sequence
• Cauchy-Sequence
• ceiling
• chain
• child
• circuit
• class
• Class
• closed
• closed
• closed
• closed
• coefficients
• commutative diagram
• commute
• Complete Induction
• Complex Conjugate
• complex conjugate
• Complex Number Operations
• complex numbers
• Complex Numbers
• Complex Root
• Complex Root Function
• Complex Roots
• Complex Square Root
• composition
• Composition of Bijective Functions
• Composition of Permutations
• Composition of Relations
• computing
• Computing
• Conditional Formula
• Conditional Term
• Congruence Properties
• congruent
• conjugate
• conjunction
• Conjunctive Laws
• connective
• constant
• constant function
• Constant Polynomials
• constrained function definition
• Constrained Function Definition
• constrained predicate definition
• Constrained Predicate Definition
• constructive
• constructors
• continuous
• Contraposition
• contraposition
• Convergence and Limit
• converges
• cosine
• cotangent
• countable
• Countable Sets
• cycle
• de Morgan
• De Morgan's Laws
• De Morgan's Laws
• decomposition
• Decomposition of Conjunctions
• Decomposition of Disjunctions
• Decomposition of Equivalences
• Decomposition of Existential Quantifications
• Decomposition of Implications
• Decomposition of Universal Quantifications
• definiendum
• definiens
• definition
• Definition
• Degree
• degree
• denominator
• descendant
• diagonalization
• Difference
• Difference
• Difference
• Difference
• direct proof
• directed graph
• Directed Graph
• discrete
• Disjoint Equivalence Classes
• disjunction
• Disjunctive Laws
• divergent
• divides
• domain
• domain
• Domain
• Domain, Range
• Domain, Range
• edges
• elementary
• elementary term
• embeds
• Empty Set
• enumeration
• Equality
• Equality and Subset
• Equality Axioms
• Equality of Sets
• Equality of Tuples
• Equivalence
• equivalence
• equivalence class
• Equivalence Laws
• Equivalence of Formulas
• equivalence relation
• Equivalence Relation
• Equivalence Relation Defines Partition
• Equivalence Relations and Partitions
• equivalent
• Euclid's algorithm
• Euler's Number
• Evaluation Laws
• exclusive disjunction
• Exclusive Disjunction
• Existence of Real Roots
• Existential Quantification in Knowledge
• explicit function definition
• Explicit Function Definition
• explicit predicate definition
• Explicit Predicate Definition
• Explicitly Defined Functions
• Explicitly Defined Predicates
• Exponential and Logarithm Properties
• Exponential Function and Logarithm Function
• Exponentiation
• Exponentiation of Relations
• factorial
• Factorial
• false
• Fibonacci Numbers
• finite
• finite sequence
• Finite Sets
• first order objects
• first order predicate logic
• floor
• Floor and Ceiling
• Floor and Ceiling
• Floor and Ceiling Removal
• Floor and Ceiling Shifts
• formula
• Formulas of Propositional Logic
• free
• Free Variable Substitution
• function
• Function
• Function Application
• function application
• Function Composition
• Function Composition
• function constant
• Function Constant
• Function Properties
• functions
• Fundamental Theorem of Algebra
• General Exponentiation and Logarithm Function
• geometric sequence
• geometric series
• grammars
• Graph Isomorphism
• greatest common divisor
• greatest element
• Hasse diagram
• height
• Height of Binary Trees
• higher order objects
• hold
• holds on
• homomorphism
• Homomorphism
• Identity Function
• identity function
• iff
• image
• Image
• imaginary constant
• imaginary part
• implementation
• implication
• Implicative Laws
• implicit function definition
• Inclusive and Exclusive Disjunction
• Incomparable
• indegree
• indirect proof
• Induced Relation
• induction axioms
• induction base
• induction hypothesis
• Induction over Term Values
• induction step
• inductive definition
• Inductive Function Definition
• Inductive Predicate Definition
• Inductive Set Definition
• infimum
• infimum
• Infimum and Supremum
• infinite
• infinite sequence
• initial node
• injective
• input condition
• input condition
• Integer Conversions
• Integer Numbers
• integer numbers
• Integer Numbers
• Integer Operations
• interpretation
• Intersection
• intervals
• Intervals
• intractable
• inverse
• Inverse Function Properties
• inverse image
• Inverse of a Function
• Inverse of a Relation
• Inversion of Negation
• irreflexive
• Irreflexive
• is element of
• isomorphic
• isomorphism
• Isomorphism of Integer Constructions
• Isomorphism of Rational Constructions
• leaf
• Least and Greatest Element
• least common multiple
• least element
• left closed
• length
• length
• level
• Level and Height
• lexicographic order
• lexicographic ordering
• limit
• Limit Laws
• Limit of Geometric Series
• Limit Quantor
• linear function
• linear order
• Local Definitions
• Logical Connective
• logical constants
• lower bound
• lower bound
• mappings
• Mathematical Induction
• Matrices over the Reals
• matrix
• Matrix
• Matrix Operations
• maximal element
• Minimal and Maximal Element
• minimal element
• minimum
• Minimum and Maximum Functions
• Minimum and Maximum Quantifier
• modular arithmetic
• Modular Arithmetic, Direct Approach
• Modular Arithmetic, Residue Classes
• Modular Congruence
• Modular Integer Numbers
• Modus Ponens
• modus ponens
• monotonically decreasing
• monotonically increasing
• Monotonicity
• multigraph
• name
• Natural Number Laws
• Natural Number Operations
• Natural Number Subsets
• natural numbers
• Natural Numbers
• Natural Numbers from Set
• Natural Numbers Operations
• Natural Numbers Operations
• negation
• Node Relations
• nodes
• Non-Empty Equivalence Classes
• null matrix
• Number of Permutations
• Number of Set Elements
• Number Quantifier
• numerator
• O Manipulation
• object constant
• objects
• one-to-one
• onto
• Order Laws
• Order Predicates
• outdegree
• output condition
• output condition
• parameterization
• parent
• partial function
• partial order
• Partial Order
• partition
• Partition
• Partition Defines Equivalence Relation
• Pascal's triangle
• path
• Path
• Peano Arithmetic
• period
• periodic
• Periodic Functions
• permutation
• Permutation
• Pointwise Function Definition
• polar coordinates
• polynomial
• Polynomial Evaluation
• polynomial function
• Polynomial Function
• Polynomial Operations
• Polynomials over the Reals
• Powerset
• predecessor
• Predecessor
• predicate constant
• Predicate Constant
• predicates
• prime
• Prime Number Factorization
• Product Quantifier
• Product Quantifier
• projections
• proof
• Proof by Case Distinction
• Proof Completion
• proof rule
• proof tree
• properties
• proposition
• proposition
• propositional consequence
• Propositional Consequences
• propositional tautology
• Quantified Formulas
• quantifier
• Quantifier
• Quantifier Consequences
• quasi order
• Quasi Order
• Quasi Order from Partial Order
• Quasi Orders Are Antisymmetric
• Quotient
• quotient
• Quotient and Remainder
• Quotient and Remainder
• quotient set
• Quotient Set
• range
• rational function
• Rational Function
• Rational Number Operations
• Rational Numbers
• rational numbers
• Rational Numbers
• Reachability is Closure of Edge Relation
• reachable
• Reachable
• real matrices
• Real Numbers
• real numbers
• Real Numbers
• real part
• Real Remainder
• Real Root Function
• realsection
• reciprocal function
• recursion formula
• recursion term
• recursive function definition
• Recursive Function Definition
• recursive predicate definition
• Recursive Predicate Definition
• reduction
• reflexive
• Reflexive and Transitive Closure
• Reflexive Closure
• reflexive closure
• reflexivity
• Reflexivity
• regularity
• relation
• Relation
• Relation Laws
• Relation Properties
• relations
• relatively prime
• remainder
• Remainder Laws
• Replacement of Local Definitions
• residue class
• Residue Class
• result
• right closed
• root
• same cardinality
• same size
• semantics
• Semantics of Atomic Formulas
• Semantics of Conjunction
• Semantics of Disjunction
• Semantics of Equivalence
• Semantics of Implication
• Semantics of Local Definitions
• Semantics of Logical Constants
• Semantics of Negation
• Semantics of Quantified Formulas
• Semantics of Terms
• sequence
• sequence
• Sequence
• Sequence Quantor
• series
• Series
• Series Limit Quantor
• set
• Set Cardinalities
• Set Enumeration
• Set Functions
• Set Identities
• Set Quantifier
• set reduction
• Set Sizes
• set theory
• simple
• sine
• Sine and Cosine
• Sine and Cosine
• Sine and Cosine Values
• size
• Size of Function Space
• Size of Powerset
• sorting
• specification
• Specification
• square function
• square function
• stepwise refinement
• Strictly Dominated
• strictly monotonically decreasing
• strictly monotonically increasing
• Structural Induction
• structurally equal
• structure
• subset
• Subset
• Subset Properties
• Substitutions
• successor
• such quantifier
• Such Quantifier
• Sum Quantifier
• Sum Quantifier
• supremum
• supremum
• surjective
• symmetric
• Symmetry
• syntax
• Syntax of Terms
• tangent
• Tangent and Cotangent
• Tangent and Cotangent Properties
• Tangent and Cotangent Values
• Tautology
• term
• Term
• term algebra
• Term Algebra
• terminal node
• termination function
• termination term
• theory
• Theory
• top down
• total degree
• total function
• total order
• Total Order
• transitive
• Transitive Closure
• Transitive Closure
• transitive closure
• transitivity
• Transitivity
• tree
• Tree
• Trees and Cycles
• Trigonometric Functions
• true
• truncated part
• Truncation
• Truncation
• truth table
• truth value
• Truth Value, Formula
• tuple
• Tuple
• tuple constructor
• tuple selectors
• undirected graph
• Undirected Graph
• Unicity of Bijection
• Unicity of Limits
• Union
• Unique Root Paths
• Uniqueness
• unity matrix
• Universal Quantification in Knowledge
• Upper and Lower Bound
• Upper and Lower Bounds
• upper bound
• upper bound
• upper bound
• upper limit
• valid
• value
• values
• variable
• variable domain
• Variable, Assignment
• Venn diagram
• verify
• vertices
• weighted graph
• Well-Founded Ordering
• witness
• zero

• Author: Wolfgang Schreiner
Last Modification: October 4, 1999