User:Domcd/Books/Logic, philosophy, language, mathematics
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 ] |
Logic, philosophy, language, mathematics[edit]
- Paraconsistent logic
- Attributional calculus
- Categorical logic
- Dependence logic
- Epsilon calculus
- First-order logic
- Frege's propositional calculus
- Higher-order logic
- Horn logic
- Implicational propositional calculus
- Independence-friendly logic
- Infinitary logic
- Intermediate logic
- Intuitionistic logic
- List of logic systems
- Logics for computability
- Many-sorted logic
- Minimal logic
- Ω-logic
- Ordinal logic
- Predicate calculus
- Predicate logic
- Propositional calculus
- Propositional proof system
- Second-order logic
- Systems of Logic Based on Ordinals
- Two-variable logic
- Type theory
- Zeroth-order logic
- Formal system
- Axiom
- Axiom schema
- Axiomatic system
- First principle
- Formal ethics
- Formal proof
- List of formal systems
- Physical symbol system
- Proof (truth)
- Rule of inference
- Non-classical logic
- Circumscription (logic)
- Computability logic
- Connexive logic
- Default logic
- Defeasible logic
- Description logic
- Deviant logic
- Dialetheism
- Evidence-based subjective logic
- Free logic
- Combs method
- Fuzzy logic
- Intensional logic
- Journal of Applied Non-Classical Logics
- Kripke semantics
- Linear logic
- Material inference
- Modal logic
- Nixon diamond
- Non-Aristotelian logic
- Non-monotonic logic
- Noneism
- Plausible reasoning
- Preferential entailment
- Probabilistic logic
- Probabilistic logic network
- Quantum logic
- Rational consequence relation
- Relevance logic
- Rvachev function
- Subjective logic
- Substructural logic
- Trivialism
- Mathematical logic
- Outline of logic
- Computability theory
- List of mathematical logic topics
- Model theory
- Proof theory
- Gödel logic
- Set theory
- Absoluteness
- Abstract logic
- Abstract model theory
- Algebraic definition
- Algebraic semantics (mathematical logic)
- Algebraic sentence
- Algebraic theory
- Algorithm
- Archive for Mathematical Logic
- Barwise compactness theorem
- Beth definability
- Bunched logic
- Cartesian monoid
- Class logic
- Classical mathematics
- Coherent space
- Cointerpretability
- Complete theory
- Completeness (logic)
- Conservativity theorem
- Continuous predicate
- Contradiction
- Contraposition
- Counting
- Craig interpolation
- Curry's paradox
- Cyclic negation
- Dedekind number
- Definable set
- Diagonal lemma
- Elementary definition
- Elementary sentence
- Elementary theory
- End extension
- Entitative graph
- Entscheidungsproblem
- Enumeration
- Equality (mathematics)
- Equational logic
- Equiconsistency
- Erasure (logic)
- Existential theory of the reals
- Extension by definitions
- Finitary
- Finitary relation
- List of first-order theories
- Formal calculation
- Formal grammar
- Foundations of mathematics
- Fragment (logic)
- Game semantics
- Glossary of Principia Mathematica
- Gödel numbering
- Gödel's β function
- Original proof of Gödel's completeness theorem
- Gödel's incompleteness theorems
- Ground expression
- Grundlagen der Mathematik
- Herbrand interpretation
- Herbrand structure
- Hilbert's program
- Hilbert–Bernays provability conditions
- Hypostatic abstraction
- Implementation of mathematics in set theory
- Impredicativity
- Indicator function
- Infinitesimal
- Institutional model theory
- Interior algebra
- Inverse relation
- Knuth's Simpath algorithm
- Kruskal's tree theorem
- Laver table
- Laws of Form
- Lévy hierarchy
- Lindenbaum's lemma
- Lindström's theorem
- Löb's theorem
- Logical assertion
- Logical equivalence
- Logical graph
- Logical machine
- Ludics
- Magnetic Tower of Hanoi
- Mereology
- Metalogic
- Metamathematics
- Non-wellfounded mereology
- Notre Dame Journal of Formal Logic
- Object language
- On Formally Undecidable Propositions of Principia Mathematica and Related Systems
- Peano axioms
- Peirce's law
- Predicate (mathematical logic)
- Principia Mathematica
- Mathematical proof
- Proof of impossibility
- Proof sketch for Gödel's first incompleteness theorem
- Proposition
- Recursion
- Recursive definition
- Relation algebra
- Residuated Boolean algebra
- Residuated lattice
- Reverse mathematics
- Rewriting
- Robinson's joint consistency theorem
- Rosser's trick
- Rules of passage (logic)
- Schröder–Bernstein property
- Semicomputable function
- Special case
- Stratification (mathematics)
- Strength (mathematical logic)
- Structural induction
- Structuralism (philosophy of mathematics)
- Structure (mathematical logic)
- Subitizing
- Successor function
- Superposition calculus
- Surreal number
- List of mathematical symbols
- List of mathematical symbols by subject
- T-schema
- Tarski's undefinability theorem
- Tautology (logic)
- Term (logic)
- Term algebra
- Timeline of mathematical logic
- Truth function
- Turing's proof
- Turnstile (symbol)
- Double turnstile
- Universe (mathematics)
- Vacuous truth
- Well-formed formula
- Witness (mathematics)
- Analytic proof
- Bachmann–Howard ordinal
- Bounded quantifier
- Büchi arithmetic
- Church–Kleene ordinal
- Completeness of atomic initial sequents
- Conservative extension
- Consistency
- Curry–Howard correspondence
- Cut-elimination theorem
- Decidability (logic)
- Decidable sublanguages of set theory
- Deduction theorem
- Deep inference
- Dialectica interpretation
- Disjunction and existence properties
- Elementary function arithmetic
- Fast-growing hierarchy
- Feferman–Schütte ordinal
- Friedman translation
- Gentzen's consistency proof
- Geometry of interaction
- Gödel's speed-up theorem
- Double-negation translation
- Gödel's completeness theorem
- Hardy hierarchy
- Herbrand's theorem
- Hilbert system
- Independence (mathematical logic)
- Interpretability
- Judgment (mathematical logic)
- Lambda-mu calculus
- Large countable ordinal
- LowerUnits
- Mathematical fallacy
- Metalanguage
- Natural deduction
- Ω-consistent theory
- Ordinal analysis
- Ordinal notation
- Paraconsistent mathematics
- Peano-Russell notation
- Presburger arithmetic
- Primitive recursive functional
- Proof calculus
- Proof compression
- Proof mining
- Proof net
- Proof procedure
- Proof-theoretic semantics
- Provability logic
- Ψ₀(Ωω)
- Pure type system
- Realizability
- Redundant proof
- Resolution inference
- Resolution proof compression by splitting
- Resolution proof reduction via local context rewriting
- Self-verifying theories
- Sequent
- Sequent calculus
- Setoid
- Slow-growing hierarchy
- Soundness
- Soundness (interactive proof)
- Structural proof theory
- Structural rule
- Takeuti's conjecture
- Tolerant sequence
- Undecidable problem
- Veblen function
- Weak interpretability
- Zariski's lemma
- Philosophical logic
- A priori and a posteriori
- Analytic reasoning
- Analytic–synthetic distinction
- Association for Logic, Language and Information
- Association for Symbolic Logic
- Categories (Peirce)
- Circular definition
- Circular reasoning
- Circular reference
- Circular reporting
- Compossibility
- Contra principia negantem non est disputandum
- Criteria of truth
- Definition
- Deontic logic
- Description
- Eternal statement
- European Summer School in Logic, Language and Information
- Existential graph
- Fitch-style calculus
- Formal fallacy
- Identity (philosophy)
- Immutable truth
- Informal fallacy
- Inquiry
- Intentional Logic
- Logical consequence
- Logical constant
- Logical quality
- Logical truth
- Main contention
- Meaning (linguistics)
- Meaning (non-linguistic)
- Meaning (philosophy of language)
- Name
- Natural language
- Nominal identity
- Nordic Journal of Philosophical Logic
- Paradox
- Pars destruens/pars construens
- Philosophy of logic
- Predicate abstraction
- Problem of future contingents
- Problem of induction
- Process of elimination
- Quantifier (logic)
- Rationality
- Reference
- Rigour
- Salva congruitate
- Sense and reference
- Slingshot argument
- State of affairs (philosophy)
- Temporal parts
- Term logic
- Theorem
- Theory of obligationes
- Tractatus Logico-Philosophicus
- Transparent Intensional Logic
- Truth
- Truth-bearer
- Vicious circle principle
- Word sense
- Infinitary combinatorics
- Set (mathematics)
- Portal:Set theory
- Admissible set
- Almost
- Benacerraf's identification problem
- BIT predicate
- Cabal (set theory)
- Cantor's diagonal argument
- Cantor's first uncountability proof
- Cantor's paradise
- Cantor's theorem
- Cardinal assignment
- Cardinality of the continuum
- Categorical set theory
- Chang's conjecture
- Class (set theory)
- Club filter
- Club set
- Clubsuit
- Code (set theory)
- Cofinality
- Condensation lemma
- Continuous function (set theory)
- Continuum (set theory)
- Controversy over Cantor's theory
- Cumulative hierarchy
- Deductive closure
- Definable real number
- Diaconescu's theorem
- Diagonal intersection
- Diamond principle
- Dimensional operator
- Easton's theorem
- Equaliser (mathematics)
- Erdős–Rado theorem
- Extension (semantics)
- Extensionality
- Fodor's lemma
- Game-theoretic rough sets
- Glossary of set theory
- Goodstein's theorem
- Hartogs number
- Hausdorff gap
- Hereditarily countable set
- Hereditarily finite set
- Hereditary property
- Hereditary set
- Hume's principle
- Ideal (set theory)
- Information diagram
- Jensen's covering theorem
- Jónsson function
- Kuratowski's free set theorem
- Laver function
- Limit cardinal
- List of exceptional set concepts
- List of set theory topics
- List of statements undecidable in ZFC
- Mathematical structure
- Mengenlehreuhr
- Milner–Rado paradox
- Morass (set theory)
- Mostowski model
- Multiplicity (mathematics)
- Naive set theory
- Normal function
- Ontological maximalism
- Open coloring axiom
- Ordinal arithmetic
- Ordinal definable set
- Pairing function
- Paradoxes of set theory
- The Paradoxes of the Infinite
- Paradoxical set
- PCF theory
- Permutation model
- Preordered class
- Primitive notion
- Primitive recursive set function
- Pseudo-intersection
- Quasi-set theory
- Recursive ordinal
- Reflection principle
- S (set theory)
- Scott's trick
- Separating set
- Set intersection oracle
- Set notation
- Set theory of the real line
- Set-builder notation
- Set-theoretic limit
- Set-theoretic topology
- Sierpiński set
- Simplified morass
- Soft set
- Solovay model
- Square principle
- Stationary set
- Subclass (set theory)
- Successor cardinal
- Sunflower (mathematics)
- Superstrong cardinal
- Support (mathematics)
- Suslin representation
- Symmetric set
- Tail sequence
- Tarski's theorem about choice
- Total order
- Transitive model
- Transitive reduction
- Transitive set
- Tree (set theory)
- Ulam matrix
- Uniformization (set theory)
- Anti-psychologism
- Conceptualism
- Conventionalism
- Epilogism
- Fictionalism
- Formalism (philosophy)
- Illuminationism
- Inferential role semantics
- Logical atomism
- Logical holism
- Logicism
- Mental model theory of reasoning
- Modal fictionalism
- Object theory
- Panlogism
- Polylogism
- Preintuitionism
- Psychologism
- Ramism
- Semantic theory of truth
- Sophism
- Supervaluationism
- Ultrafinitism
- Unifying theories in mathematics
- Law of thought
- List of logicians
- Peter Abelard