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
Adaptive grammar
Affix grammar
Alethic modality
Algebraic data type
Alphabet (formal languages)
Alternation (formal language theory)
Ambiguous grammar
Anamorphism
Anonymous function
Anonymous recursion
Answer set programming
Anti-unification (computer science)
Applicative functor
Apply
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
Barcan formula
Belief revision
Bisimulation
Boolean satisfiability problem
Bottom type
Bottom-up parsing
Brouwer–Heyting–Kolmogorov interpretation
Brzozowski derivative
Buridan formula
Calculus of constructions
Call-with-current-continuation
Case-based reasoning
Catamorphism
Categorical quantum mechanics
Chart parser
Chomsky hierarchy
Chomsky normal form
Church encoding
Circumscription (logic)
Classical modal logic
Clock (model checking)
Closed-world assumption
Coinduction
Combinatory categorial grammar
Combinatory logic
Common Lisp
Compiler-compiler
Computation tree logic
Computer science
Concatenation
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)
Controlled grammar
Coq
Corecursion
Correctness (computer science)
Counterfactual conditional
Counterpart theory
CTL*
Currying
Cut (logic programming)
CYK algorithm
Datalog
Declarative programming
Deductive lambda calculus
Default logic
Defeasible reasoning
Definite clause grammar
Defuzzification
Dempster–Shafer theory
Denotational semantics
Deontic logic
Dependent type
Description logic
Deterministic context-free language
Dialetheism
Difference bound matrix
Domain theory
Doxastic logic
Dyck language
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
Filter (higher-order function)
First-class function
Fixed-point combinator
Fluent (artificial intelligence)
Fluent calculus
Fold (higher-order function)
Formal equivalence checking
Formal grammar
Formal language
Formal methods
Formal verification
Formation rule
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
Greibach normal form
Growing context-sensitive grammar
Haskell (programming language)
Head grammar
Hennessy–Milner logic
Higher-order function
Hindley–Milner type system
Hoare logic
Homotopy type theory
Horn clause
Hylomorphism (computer science)
Impossible world
Imprecise probability
Indexed grammar
Indexed language
Induction-recursion
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)
Kuroda normal form
L-system
Lambda calculus
Lambda cube
Lazy evaluation
Left corner
Left recursion
Lexical grammar
Linear grammar
Linear logic
Linear temporal logic
Lisp (programming language)
List comprehension
LL parser
Local language (formal language)
Logic programming
Logical possibility
LR parser
Many-valued logic
Map (higher-order function)
Markov logic network
Matrix grammar
Membership function (mathematics)
Memoization
Metalanguage
Metaphysical necessity
Metaprogramming
Metasyntax
Metric interval temporal logic
Metric temporal logic
Minimalist grammar
ML (programming language)
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
Myhill–Nerode theorem
Negation as failure
Non-monotonic logic
Noncommutative logic
Noncontracting grammar
Normal form (abstract rewriting)
Normal modal logic
Normalization property (abstract rewriting)
Object language
Ogden's lemma
Omega language
Omega-regular language
Open-world assumption
Operational semantics
Paraconsistent logic
Parser combinator
Parsing
Parsing expression grammar
Partial application
Partial order reduction
Pattern language (formal languages)
Pattern matching
Plausible reasoning
Possibility theory
Possible world
Power domains
Prefix grammar
Principal type
Probabilistic logic
Probabilistic logic network
Problem of future contingents
Product type
Production (computer science)
Program synthesis
Program transformation
Programming language theory
Prolog
Proof assistant
Pumping lemma for context-free languages
Pumping lemma for regular languages
Pure type system
Quantum logic
Quine (computing)
Quotient of a formal language
Ranked alphabet
Reasoning system
Recursion (computer science)
Recursive ascent parser
Recursive data type
Recursive descent parser
Recursive language
Recursively enumerable language
Reduction strategy (lambda calculus)
Reflection (computer programming)
Regular expression
Regular grammar
Regular language
Regular modal logic
Regular tree grammar
Relevance logic
Rewriting
Rough set
Runtime verification
S5 (modal logic)
Scheme (programming language)
Scott domain
Scott information system
Self-modifying code
Semantics (computer science)
Semi-Thue system
Set constraint
Shift-reduce parser
Signal (model checking)
Simply typed lambda calculus
Situation calculus
SLD resolution
Stable model semantics
Star height
Star-free language
Straight-line grammar
Strict conditional
String operations
Structural rule
Stutter bisimulation
Subjective logic
Subjunctive possibility
Substructural logic
Syntactic monoid
T-norm
T-norm fuzzy logics
Tagged union
Tail call
Temporal logic
Terminal and nonterminal symbols
Theoretical computer science
Thompson's construction
Three-valued logic
Timed propositional temporal logic
Timed word
Top-down parsing
Top-down parsing language
Transferable belief model
Transition system
Tree automaton
Tree transducer
Tree-adjoining grammar
Tuple
Type constructor
Type inference
Type inhabitation
Type theory
Type variable
Typed lambda calculus
Unification (computer science)
Uniqueness type
Unit type
Unrestricted grammar
Upper and lower probabilities
Well-founded semantics
Wirth syntax notation
Wolfram Language
Wolfram Mathematica
Łukasiewicz logic
Μ-recursive function