User:Mhss en
From Wikipedia, the free encyclopedia
| Wikipedia:Babel | |||||||||
|---|---|---|---|---|---|---|---|---|---|
|
|||||||||
| Search user languages | |||||||||
My home page: 寒蝉退士
My user page in chinese: Mhss
I had translated the following entries into chinese:
Red-black tree AVL tree B-tree Skip list PostgreSQL SQLite Relational model 2-3-4 tree Horn clause Logical reasoning Retroduction Unification Resolution (logic) Non-monotonic logic Substructural logic Classical logic Begriffsschrift Nyaya Sutras Propositional calculus Multi-valued logic Term logic Square of opposition Frege's propositional calculus Intuitionistic logic Intermediate logics Predicate calculus Second-order logic Higher-order logic Modal logic Boolean logic Entity-relationship model Boole's syllogistic Categorical syllogism Hypothetical syllogism Disjunctive syllogism SyllogismBoolean algebra Boolean function Canonical form (Boolean algebra) Quasi-syllogism Euler diagram Venn diagram Spider diagram Truth table Computability logic Kripke semantics Relevance logic Principle of explosion Paraconsistent logic Strict conditional Defeasible reasoning Deductive reasoning Abductive reasoning Induction (philosophy) Closed World Assumption Negation as failure Open World Assumption Defeasible logic Answer set programming Autoepistemic logic Default logic Material conditional Temporal logic Indicative conditional Counterfactual conditional Entailment Laws of thought Law of noncontradiction Law of identity Domain of discourse Principle of bivalence Truth value Philosophical logic Extension (semantics) Fuzzy logic Axiom schema Law of excluded middle Free logic Generalization (logic) Atomic sentence Sentence (mathematical logic) Possible world Peirce's law Logic Logical equivalence Truth function Lindenbaum–Tarski algebra Heyting algebra Modus ponens Open sentence Table of logic symbols Quine-McCluskey algorithm Implicant Accessibility relation Quantification Free variables and bound variables Linear logic Epistemic logic Boolean-valued function Existential graph Prenex normal form Skolem normal form Axiom of choice Tractatus Logico-Philosophicus Existential quantification Formula (mathematical logic) MV-algebra Residuated lattice WFF Semantics of logic Problem of multiple generality Antecedent (logic) Consequent Sequent Atomic formula Propositional variable Sequent calculus Cut-elimination theorem Deduction theorem Recursive function Register machine Computable function Markov algorithm Recursive set Recursively enumerable set Primitive recursive function Pairing function Post-Turing machine Tag system Gödel number Hoare logic Curry-Howard Simply typed lambda calculus Intuitionistic Type Theory B,C,K,W system Combinatory logic Higher-order function SKI combinator calculus Church encoding Fixed point combinator Predicate variable Semantic theory of truth Extensionality Beta normal form T-schema Well-order Probabilistic logic Logical harmony Rule of inference Validity BHK interpretation Natural deduction Structural rule Structure (mathematical logic) Recursion theory Game semantics Impredicative Directed set Functional predicate Truth-value semantics Compactness theorem Gödel's completeness theorem Soundness theorem Least fixed point Zeroth-order logic Calculus of constructions Normalization property (lambda-calculus) Domain theory Kleene fixpoint theorem Scott continuity Complete partial order Axiom of infinity Filter (mathematics) Boolean ring Ideal (order theory) Axiom of extensionality Axiom schema of specification Axiom of pairing Axiom of empty set Axiom of union Axiom of power set Axiom of regularity Uniqueness quantification Well-ordering theorem Von Neumann universe Hereditarily finite set Class (set theory) Ur-element Zermelo–Fraenkel set theory Axiom schema of replacement Löwenheim–Skolem theorem Elementary substructure Submodel Mostowski collapse Transitive set Least upper bound axiom Relatively complemented lattice Elementarily equivalent Skolem's paradox Transfinite number Burali-Forti paradox Cantor's paradox Absolute Infinite Cantor's theorem Infinite descending chain Order type Limit ordinal Von Neumann cardinal assignment Cantor–Bernstein–Schroeder theorem Equinumerosity Cardinal assignment Ordered pair Axiom of limitation of size Axiom of global choice Equivalence class Cartesian product New Foundations Von Neumann–Bernays–Gödel set theory Zermelo set theory LF (logical framework) Literal (mathematical logic) Clause (logic) Conjunctive normal form Disjunctive normal form Upper set Boolean prime ideal theorem First-order logic System F Sheffer stroke Entitative graph Universal instantiation Sole sufficient operator Distribution of terms Kleene algebra Semiring Two-level grammar Ternary logic Free Boolean algebra Complete Boolean algebra Set-theoretic definition of natural numbers Trichotomy (mathematics) Cofinality Partition of a set Index set Complete lattice Lattice (order) Supremum Infimum Partially ordered set Total order Meet (mathematics) Join (mathematics) Compact element Scott domain Monotonic function μ operator Transfinite induction Continued fraction Counter machine Exponential function Logarithm Nth root List of trigonometric identities Trigonometric function Inverse trigonometric function Conic section Hyperbola Linear map Rotation (mathematics) Reflection (mathematics) Scaling (geometry) Projection (linear algebra) Null space Kernel (algebra) Quadratic form Bilinear map Symmetric bilinear form Definite bilinear form Multilinear map Orthogonal matrix Householder transformation Givens rotation Jacobi rotation Inversion in a point Rotation matrix Axis angle Transpose Basis (linear algebra) Tensor product Dyadic product Outer product Sesquilinear form Multilinear form Orthogonal complement Closure (mathematics) Rank (linear algebra) Row and column spaces Linear subspace Diagonalizable matrix Knaster–Tarski theorem Augmented Backus–Naur form Type inference Typed lambda calculus Dependent type Subtype SECD machine Extended Backus–Naur form Chomsky normal form Context-sensitive grammar Noncontracting grammar Kuroda normal form Indexed grammar Indexed language Mildly context-sensitive language Tree-adjoining grammar Context-free language Context-sensitive language Unrestricted grammar Deterministic context-free grammar Myhill–Nerode theorem Prefix grammar String operations Alphabet (computer science) Syntactic monoid Recognizable language Ogden's lemma Congruence relation Semigroup Deterministic pushdown automaton Linear bounded automaton Automata theory Deterministic finite-state machine Nondeterministic finite state machine Machine that always halts Semiautomaton State transition table Powerset construction State diagram Moore machine Mealy machine Finite state machine Iterated function Lispkit Lisp ISWIM Eager evaluation Evaluation strategy Principle of compositionality HSL color space CIE 1931 color space Lab color space
