User:Zarzuelazen/Books/Reality Theory: Computational&Non-Classical Logic
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| 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 Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Reality Theory: Computational&Non-Classical Logic
- 2-satisfiability
- Abductive logic programming
- Abstract interpretation
- Abstract rewriting system
- Abstraction model checking
- Accessibility relation
- Action algebra
- Action language
- Actor model
- Actor model and process calculi
- Adaptive grammar
- Affix grammar
- Alethic modality
- Algebraic data type
- Alphabet (formal languages)
- Alternating-time temporal logic
- Alternation (formal language theory)
- Ambient calculus
- Ambiguous grammar
- Anamorphism
- And–or tree
- Anonymous function
- Anonymous recursion
- Answer set programming
- Anti-unification (computer science)
- Applicative functor
- Apply
- Approximate string matching
- Arrow (computer science)
- Attribute grammar
- Augmented Backus–Naur form
- Autoepistemic logic
- Automated reasoning
- Automated theorem proving
- Automatic programming
- Axiomatic semantics
- B, C, K, W system
- Backus–Naur form
- Backward chaining
- Barcan formula
- Bisimulation
- Boolean grammar
- Boolean satisfiability problem
- Bottom type
- Bottom-up parsing
- Branching quantifier
- Brouwer–Heyting–Kolmogorov interpretation
- Brzozowski derivative
- Bunched logic
- Buridan formula
- Böhm tree
- Calculus of communicating systems
- Calculus of constructions
- Call-with-current-continuation
- Catamorphism
- Categorial grammar
- Chart parser
- Chomsky hierarchy
- Chomsky normal form
- Church encoding
- Circumscription (logic)
- Classical modal logic
- Clock (model checking)
- Closed-world assumption
- Coinduction
- Combinatorics on words
- Combinatory categorial grammar
- Combinatory logic
- Communicating sequential processes
- Compiler-compiler
- Computability logic
- Computation tree logic
- Computational logic
- Computer science
- Computer scientist
- Computer-assisted proof
- Concatenation
- Concurrent constraint logic programming
- Concurrent logic programming
- Cone (formal languages)
- Conflict-driven clause learning
- Confluence (abstract rewriting)
- Conjugacy problem
- Conjunctive grammar
- Cons
- Constraint logic programming
- Container (type theory)
- 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
- Credal set
- Critical pair (logic)
- CTL*
- Currying
- Cut (logic programming)
- CYK algorithm
- Dangling else
- Datalog
- Davis–Putnam algorithm
- Deductive lambda calculus
- Default logic
- Definite clause grammar
- Defuzzification
- Dempster–Shafer theory
- Denotational semantics
- Deontic logic
- Dependence logic
- Dependency relation
- Dependent type
- Description logic
- Deterministic context-free language
- Dialetheism
- Dialogical logic
- Difference bound matrix
- Divergence (computer science)
- Domain theory
- Double pushout graph rewriting
- Doxastic logic
- DPLL algorithm
- Dyck language
- Dynamic epistemic logic
- Dynamic logic (modal logic)
- Eager evaluation
- Earley parser
- Edit distance
- Effect system
- Empty string
- Epistemic modal logic
- Epistemic possibility
- Equivalence (formal languages)
- Evaluation strategy
- Event calculus
- 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 specification
- Formal verification
- Formation rule
- Forward chaining
- Four-valued logic
- Free logic
- Fréchet inequalities
- Function type
- Fuzzy concept
- Fuzzy logic
- Fuzzy number
- Fuzzy set
- Fuzzy set operations
- Game Description Language
- Game semantics
- General frame
- Generalized algebraic data type
- Generalized context-free grammar
- Generalized quantifier
- Gleason's theorem
- GLR parser
- Graph reduction
- Graph rewriting
- Greibach normal form
- Group isomorphism problem
- Growing context-sensitive grammar
- Hall word
- Head grammar
- Hennessy–Milner logic
- Higher-order function
- Hindley–Milner type system
- History monoid
- Hoare logic
- HOL (proof assistant)
- Homoiconicity
- Homotopy type theory
- Horn clause
- Horn-satisfiability
- Hylomorphism (computer science)
- Impossible world
- Imprecise probability
- Independence-friendly logic
- Indexed grammar
- Indexed language
- Induction-recursion
- Inductive logic programming
- Inductive type
- Infinitary logic
- Intensional logic
- Interaction nets
- Interpretability logic
- Intersection type
- Intersection type discipline
- Intuitionistic logic
- Intuitionistic type theory
- Isabelle (proof assistant)
- Japaridze's polymodal logic
- Kahn process networks
- Karnaugh map
- Kind (type theory)
- Kleene algebra
- Kleene star
- Kleene's algorithm
- Kleene's recursion theorem
- Kripke semantics
- Kripke structure (model checking)
- Kuroda normal form
- L-system
- Lambda calculus
- Lambda calculus definition
- Lambda cube
- Lambda lifting
- Language equation
- Lazy evaluation
- Lean (proof assistant)
- Left corner
- Left recursion
- Levenshtein distance
- Lexical analysis
- Lexical grammar
- Lexicographical order
- Linear grammar
- Linear logic
- Linear temporal logic
- Linear time property
- List comprehension
- Liveness
- LL parser
- Local language (formal language)
- Logic for Computable Functions
- Logic programming
- Logical framework
- Logical possibility
- Loop invariant
- Loop variant
- LR parser
- Lyndon word
- Many-valued logic
- Map (higher-order function)
- Matrix grammar
- Maximum satisfiability problem
- Membership function (mathematics)
- Memoization
- Metalanguage
- Metamath
- Metaphysical necessity
- Metaprogramming
- Metasyntax
- Metric interval temporal logic
- Metric temporal logic
- Minimalist grammar
- Mizar system
- Modal companion
- Modal depth
- Modal fallacy
- Modal logic
- Modal operator
- Modal μ-calculus
- Model checking
- Monad (functional programming)
- Monad transformer
- Monoidal t-norm logic
- Monomial order
- Morphic word
- Multimodal logic
- Mutual recursion
- Myhill–Nerode theorem
- Necessity and sufficiency
- Negation as failure
- Neighborhood semantics
- Nested word
- Non-monotonic logic
- Noncommutative logic
- Noncontracting grammar
- Normal form (abstract rewriting)
- Normal modal logic
- Normalization property (abstract rewriting)
- Not-all-equal 3-satisfiability
- Object language
- Occurs check
- Ogden's lemma
- Omega language
- Omega-regular language
- Open-world assumption
- Operational semantics
- Ordered graph
- Paraconsistent logic
- Parameter word
- Parser combinator
- Parsing
- Parsing expression grammar
- Partial application
- Partial order reduction
- Partial word
- Path ordering (term rewriting)
- Pattern language (formal languages)
- Pattern matching
- Plausible reasoning
- Polynomial functor (type theory)
- Possibility theory
- Possible world
- Power domains
- Prefix grammar
- Principal type
- Probabilistic logic
- Probability bounds analysis
- Probability box
- Problem of future contingents
- Process calculus
- Product type
- Production (computer science)
- Profinite word
- Program synthesis
- Program transformation
- Programming language theory
- Prolog
- Proof assistant
- Provability logic
- Pumping lemma for context-free languages
- Pumping lemma for regular languages
- Pure type system
- Quine (computing)
- Quine–McCluskey algorithm
- Quotient of a formal language
- Quotient type
- Ranked alphabet
- Recursion (computer science)
- Recursive ascent parser
- Recursive data type
- Recursive descent parser
- Recursive language
- Recursively enumerable language
- Reduction strategy (lambda calculus)
- Reflection (computer programming)
- Region (model checking)
- Regular expression
- Regular grammar
- Regular language
- Regular modal logic
- Regular tree grammar
- Regulated rewriting
- Relevance logic
- Rewrite order
- Rewriting
- Rough set
- Runtime verification
- S-expression
- S5 (modal logic)
- Safety property
- Satisfiability modulo theories
- Scott continuity
- Scott domain
- Scott information system
- Self-modifying code
- Semantics (computer science)
- Semantics encoding
- Semi-Thue system
- Separation logic
- Sesquipower
- Set constraint
- Shift-reduce parser
- Shortlex order
- Signal (model checking)
- Simply typed lambda calculus
- Situation calculus
- SKI combinator calculus
- SLD resolution
- Square-free word
- Stable model semantics
- Star height
- Star height problem
- Star-free language
- Straight-line grammar
- Strict conditional
- Strict function
- String metric
- String operations
- String-searching algorithm
- Structural rule
- Sturmian word
- Stutter bisimulation
- Subjective logic
- Subjunctive possibility
- Substructural logic
- Symbolic execution
- Symbolic integration
- Syntactic monoid
- System U
- 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
- Thue–Morse sequence
- Timed propositional temporal logic
- Timed word
- Top-down parsing
- Top-down parsing language
- Trace monoid
- Transferable belief model
- Transition system
- Transparent intensional logic
- Tree automaton
- Tree transducer
- Tree-adjoining grammar
- True quantified Boolean formula
- Tuple
- Two-level grammar
- Type constructor
- Type family
- Type inference
- Type inhabitation
- Type rule
- Type theory
- Type variable
- Typed lambda calculus
- Unavoidable pattern
- Unification (computer science)
- Uniqueness type
- Unit propagation
- Unit type
- Unrestricted grammar
- Upper and lower probabilities
- Well-founded semantics
- Well-structured transition system
- Widening (computer science)
- Wirth syntax notation
- Wolfram Language
- Wolfram Mathematica
- Word problem (mathematics)
- Word problem for groups
- Łukasiewicz logic
- Μ-recursive function
- Π-calculus