User:Zarzuelazen/Books/Reality Theory: Computational&Non-Classical Logic

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

K4 frame.PNG
This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance).

Edit this book: Book Creator · Wikitext
Select format to download:

PDF (A4) · PDF (Letter)

Order a printed copy from these publishers: PediaPress
About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] Recent Changes ]

Reality Theory: Computational&Non-Classical Logic[edit]

Abductive logic programming
Abstract interpretation
Abstract rewriting system
Accessibility relation
Action language
Affix grammar
Alphabet (formal languages)
Alternation (formal language theory)
Ambiguous grammar
Anonymous recursion
Answer set programming
Applicative functor
Arrow (computer science)
Attribute grammar
Augmented Backus–Naur form
Autoepistemic logic
Automated reasoning
Automated theorem proving
Automatic programming
Axiomatic semantics
Backus–Naur form
Backward chaining
Belief revision
Boolean satisfiability problem
Bottom type
Bottom-up parsing
Brouwer–Heyting–Kolmogorov interpretation
Calculus of constructions
Case-based reasoning
Categorical quantum mechanics
Chart parser
Chomsky hierarchy
Church encoding
Circumscription (logic)
Classical modal logic
Closed-world assumption
Combinatory categorial grammar
Combinatory logic
Common Lisp
Computation tree logic
Concurrent constraint logic programming
Concurrent logic programming
Confluence (abstract rewriting)
Constraint logic programming
Context-free grammar
Context-free language
Context-sensitive grammar
Context-sensitive language
Contingency (philosophy)
Continuation-passing style
Correctness (computer science)
Counterfactual conditional
Cut (logic programming)
CYK algorithm
Declarative programming
Deductive lambda calculus
Default logic
Defeasible reasoning
Definite clause grammar
Dempster–Shafer theory
Denotational semantics
Deontic logic
Dependent type
Description logic
Deterministic context-free language
Domain theory
Doxastic logic
Dynamic epistemic logic
Dynamic logic (modal logic)
Eager evaluation
Earley parser
Effect system
Empty string
Epistemic modal logic
Epistemic possibility
Equivalence (formal languages)
Evaluation strategy
Event calculus
Expert system
Explicit substitution
Extended Backus–Naur form
Fixed-point combinator
Fluent (artificial intelligence)
Fluent calculus
Fold (higher-order function)
Formal equivalence checking
Formal grammar
Formal language
Formal methods
Formal verification
Forward chaining
Four-valued logic
Free logic
Function type
Functional programming
Fuzzy concept
Fuzzy logic
Fuzzy number
Fuzzy set
Fuzzy set operations
Game semantics
Generalized context-free grammar
Gleason's theorem
GLR parser
Graph reduction
Graph rewriting
Haskell (programming language)
Head grammar
Hennessy–Milner logic
Hindley–Milner type system
Hoare logic
Homotopy type theory
Horn clause
Hylomorphism (computer science)
Impossible world
Imprecise probability
Indexed grammar
Indexed language
Inductive logic programming
Inductive type
Inference engine
Infinitary logic
Intuitionistic logic
Intuitionistic type theory
Kind (type theory)
Kleene star
Kleene's algorithm
Kleene's recursion theorem
Knowledge base
Kripke semantics
Kripke structure (model checking)
Lambda calculus
Lazy evaluation
Left corner
Left recursion
Lexical grammar
Linear logic
Linear temporal logic
Lisp (programming language)
LL parser
Logic programming
Logical possibility
LR parser
Many-valued logic
Markov logic network
Membership function (mathematics)
Metaphysical necessity
Minimalist grammar
Modal companion
Modal fallacy
Modal logic
Modal operator
Modal realism
Modal μ-calculus
Model checking
Monad (functional programming)
Monad transformer
Monoidal t-norm logic
Multimodal logic
Mutual recursion
Negation as failure
Non-monotonic logic
Noncommutative logic
Normal form (abstract rewriting)
Normal modal logic
Normalization property (abstract rewriting)
Open-world assumption
Operational semantics
Paraconsistent logic
Parser combinator
Parsing expression grammar
Partial application
Partial order reduction
Pattern matching
Plausible reasoning
Possibility theory
Possible world
Power domains
Principal type
Probabilistic logic
Probabilistic logic network
Problem of future contingents
Product type
Production (computer science)
Program synthesis
Program transformation
Programming language theory
Proof assistant
Quantum logic
Quine (computing)
Reasoning system
Recursion (computer science)
Recursive ascent parser
Recursive descent parser
Recursive language
Recursively enumerable language
Reduction strategy (lambda calculus)
Reflection (computer programming)
Regular expression
Regular grammar
Regular language
Regular modal logic
Relevance logic
Runtime verification
Scheme (programming language)
Scott domain
Scott information system
Self-modifying code
Semantics (computer science)
Semi-Thue system
Shift-reduce parser
Simply typed lambda calculus
Situation calculus
SLD resolution
Stable model semantics
Star-free language
Strict conditional
String operations
Structural rule
Subjective logic
Subjunctive possibility
Substructural logic
Syntactic monoid
T-norm fuzzy logics
Tagged union
Temporal logic
Terminal and nonterminal symbols
Thompson's construction
Three-valued logic
Top-down parsing
Transferable belief model
Transition system
Tree-adjoining grammar
Type constructor
Type inhabitation
Type theory
Typed lambda calculus
Unification (computer science)
Uniqueness type
Unit type
Unrestricted grammar
Well-founded semantics
Wirth syntax notation
Wolfram Language
Wolfram Mathematica
Łukasiewicz logic
Μ-recursive function