Glossary of logic

This is a glossary of logic. Logic is the study of the principles of valid reasoning and argumentation.

A
A-proposition: A type of standard-form categorical proposition, asserting that all members of the subject category are included in the predicate category; symbolized as "All S are P".

abduction: A form of reasoning characterized by drawing a conclusion based on the best available explanation for a set of premises. Often used in hypothesis formation.

Abelian logic: A type of relevance logic that rejects and accepts that ((A → B) → B) → A.

absorption: A logical rule stating that if a proposition implies another, then adding any additional conjunction to the first proposition does not change the implication. Symbolized as $P \rightarrow Q \equiv (P \land R) \rightarrow Q$.

abstract object: An object that does not exist at any particular time or place but rather exists as a type of thing—i.e., an idea, or abstraction.

abstraction: The process or result of generalization by reducing the information content of a concept or an observable phenomenon, typically to retain only information which is relevant for a particular purpose.

abstraction operator: The function implicitly defined by an.

abstraction principle: A formula of the form (∀α)(∀β)(Abst(α) = Abst(β) ↔ Equ(α, β)), where Abst is an mapping the type of entities ranged over by α and β to objects, and “Equ” is an equivalence relation on the type of entities ranged over by α and β. For instance,, and.

accessibility relation: In modal logic, a relation that describes which worlds are accessible from other worlds in the semantics of possible world models.

actual world: In modal logic, the world that is considered to be the real world, as opposed to possible worlds which are considered in modal reasoning.

addition: A rule of inference in formal logic where from any proposition, a disjunction can be formed by disjoining it with any other proposition. Symbolized as $P \vdash P \lor Q$.

ad hominem: A fallacy in argumentation that targets the person making an argument rather than the argument itself.

ad ignorantium: A logical fallacy where a proposition is considered true because it has not been proven false or vice versa.

ad infinitum: An argument or process that is supposed to continue indefinitely, without ever reaching an end or conclusion.

adjunction: See.

affine logics: A subfield of linear logic focusing on the study of affine transformations and their implications in logical reasoning.

affirmative proposition: A proposition that asserts the truth of a statement, as opposed to negating it.

affirming the consequent: A logical fallacy in which a conditional statement is incorrectly used to infer its converse. For example, from "If P then Q" and "Q", concluding "P".

alethic modal logic: A type of modal logic that deals with modalities of truth, such as necessity and possibility.

ambiguity: The property of a statement or phrase having more than one meaning or interpretation.

amphiboly: A type of ambiguity resulting from ambiguous grammatical structure, rather than the ambiguity of individual words.

analethic logic: A where the third truth value is the "neither true nor false" ("N"), and the  are "true" and "neither true nor false."

analysis: Analysis, the process of breaking a concept down into more simple parts, so that its logical structure is displayed. Mathematical analysis

analytic: A statement that is true by virtue of its meaning, such as definitions or statements grounded in logical laws.

anaphora: A rhetorical device that consists of repeating a sequence of words at the beginnings of neighboring clauses, thereby lending them emphasis.

ancestral: In logic and mathematics, the transitive closure of a relation, capturing the idea of indirect relationships across generations or iterations.

antecedent: The first part of a conditional statement, the "if" clause, which specifies a condition for the consequent.

anti-extension: In set theory and logic, the complement of the extension of a concept or predicate, consisting of all objects that do not fall under the concept.

antilogism: A syllogism with three premises leading to a contradiction, showing the inconsistency of the premises.

antinomy: A contradiction between two beliefs or conclusions that are in themselves reasonable; a paradox.

antisymmetry: A property of a relation $R$, where for any two elements $a$ and $b$, if $aRb$ and $bRa$, then $a = b$.

a posteriori: Knowledge or justification is said to be a posteriori if it depends on empirical evidence or experience.

a priori: Knowledge or justification is said to be a priori if it is independent of empirical evidence or experience, such as logic or mathematics.

argument: A series of statements typically used to persuade someone of something or to present reasons for accepting a conclusion.

Aristotelian comprehension schema: This formula in second-order logic: (∃x)Φ → (∃Y)(∀x)(Yx ↔ Φ).

Aristotelian logic: The traditional logic developed by Aristotle, based on the study of syllogism and the principle of non-contradiction.

Aristotle's sea battle: A thought experiment by Aristotle to explore the concept of future contingents and the problem of determinism and free will.

Aristotle's theses: The formulas ¬ (¬ A → A) and ¬ (A → ¬A) in propositional logic; they are theorems in connexive logic but not in classical logic. See also.

arity: The number of arguments or operands that a function, operation, or relation takes. In logic, it refers to the number of terms that a predicate has.

assertion: The principle, or axiom, that (A ∧ (A → B)) → B. Also called.

associativity: A property of some binary operations in which the grouping of operations does not affect the result. For example, in arithmetic, addition and multiplication are associative.

asymmetry: A relation between two entities where if the first is related to the second, the second is not related to the first.

atomic formula: The simplest type of formula in logic, consisting of a single predicate applied to a sequence of terms without any logical connectives.

atomic sentence: A sentence that contains no logical connectives or quantifiers, expressing a basic statement about objects.

autological: A term that describes itself. For example, the word "short" is autological because it is a short word.

automaton: A self-operating machine or, in computer science, a theoretical model of computation that performs tasks according to a set of rules or a program.

automorphism: An isomorphism from a mathematical object to itself, preserving all the structure of the object. In logic, it often refers to symmetries within logical structures.

axiological logic: A branch of logic that deals with the study of value, including ethical and aesthetic values, often in the context of modal logic.

axiom: A statement or proposition that is accepted as true without proof, serving as a starting point for further reasoning and arguments.

B
bad company objection: An objection to mathematical abstractionism that points out the difficulty in distinguishing between legitimate and illegitimate forms of abstraction, particularly in the context of Frege's Basic Law V and the paradoxes it generates.

barbara: A standard form of categorical syllogism in Aristotelian logic, where all three propositions (major premise, minor premise, and conclusion) are universal affirmatives, symbolized as AAA. The form is: All M are P, All S are M, therefore All S are P.

Barcan formula: A principle in modal logic that asserts the interchangeability of quantification and possibility: necessarily, if there exists something, then there necessarily exists something.

Basic Law V: A principle proposed by Gottlob Frege in his attempt to reduce arithmetic to logic, stating that the extension of a concept is determined by the objects falling under the concept. It leads to Russell's paradox.

basis: The initial case in a proof by mathematical induction.

Bayes' theorem: A theorem in probability theory used to update the probability for a hypothesis as more evidence or information becomes available.

begging the question: A logical fallacy where the conclusion of an argument is assumed in the premise, making the argument circular.

Bew: See.

BHK-interpretation: The Brouwer-Heyting-Kolmogorov interpretation, a constructivist interpretation of intuitionistic logic, where the truth of a statement is equated with the existence of a proof for it.

bias: A systematic deviation from neutrality, objectivity, or fairness, often resulting from a particular tendency or inclination, especially in statistical or cognitive contexts.

biconditional: A logical connective between statements, where both statements imply each other; often denoted as $P \leftrightarrow Q$, meaning "P if and only if Q".

bijective: A function that is both injective (no two elements of the domain map to the same element of the codomain) and surjective (every element of the codomain is mapped to by some element of the domain), establishing a one-to-one correspondence between the domain and codomain.

binary function: A function that takes two arguments. In logic and mathematics, this is often a function that combines two values to produce a third value, such as addition or multiplication in arithmetic.

binary relation: A relation involving two terms or elements, defining a particular relationship between pairs of objects from two sets (or from one set to itself).

bivalence: The principle that any proposition is either true or false, with no middle ground; foundational to classical logic.

Boethius' theses: The formulas (A → B) → ¬ (A → ¬ B) and (A → ¬ B) → ¬ (A → B) in propositional logic; they are theorems in connexive logic but not in classical logic. See also.

Boolean algebra: An area of algebra in which the values of the variables are the truth values true and false, typically used in computer science, logic, and mathematical logic.

Boolean negation: A form of negation where the negation of a non-true proposition is true, and the negation of a non-false proposition is false.

Boolean operator: An operator used in logic and computer science that performs logical operations on its operands, such as AND, OR, and NOT.

borderline case: A situation or instance that falls at the boundary between categories or classifications, often challenging strict definitions or distinctions.

bottom: In logic, the symbol used to represent a contradiction or an absurdity; often denoted by the symbol $\bot$.

bound variable: A variable that is quantified over in a logical expression, as opposed to a free variable, which is not bound by a quantifier.

bounded quantifier: A quantifier that operates within a specific domain or set, as opposed to an unbounded or universal quantifier that applies to all elements of a particular type.

branching quantifier: A type of quantifier in formal logic that allows for the expression of dependencies between different quantified variables, representing more complex relationships than can be expressed with standard linear quantification.

Brouwerian modal logic: A form of modal logic that incorporates principles of intuitionism, as developed by L.E.J. Brouwer, focusing on the notion of possibility grounded in constructivist or intuitionist mathematics.

Buridan's sophismata: A collection of paradoxes and logical exercises attributed to the medieval philosopher Jean Buridan, designed to challenge logical and linguistic intuitions.

busy beaver problem: A problem in computability theory that seeks the Turing machine with the largest possible behavior (e.g., producing the most output, running the longest) among all Turing machines of a certain size, illustrating limits of computability.

C
Caesar problem: A problem in the philosophy of language and logic regarding the applicability of mathematical concepts to non-mathematical objects, famously illustrated by Gottlob Frege's question of whether the concept of being a successor in number applies to Julius Caesar.

Carnap-Ramsey sentence: A sentence formulated to express the empirical content of a theory in logical positivism, named after Rudolf Carnap and Frank P. Ramsey, aimed at separating theoretical terms from observational terms.

categorical: A theory is categorical if all its models are isomorphic, meaning they describe the same mathematical structures in different ways.

categorical logic: A branch of logic that studies the categorization of objects and the logical foundations of categories, often using the framework of category theory.

categorical proposition: A proposition that asserts or denies that all or some of the members of one category are included in another category, fundamental in syllogistic reasoning.

categorical syllogism: A form of deductive reasoning in Aristotelian logic consisting of three categorical propositions that involve three terms and deduce a conclusion from two premises.

category: In mathematics and logic, a collection of objects and morphisms between them that satisfies certain axioms, fundamental to category theory.

category theory: A branch of mathematics that deals with abstract algebraic structures and relationships between them, providing a unifying framework for various areas of mathematics.

causal logic: A branch of logic concerned with the study of causal relationships, including the representation and reasoning about causes and effects.

causal modal logic: An extension of modal logic that includes modalities for necessity and possibility along with causal relations, allowing for the formal analysis of causal statements.

chronological logic: See.

Church's theorem: A theorem establishing the undecidability of certain decision problems in logic, such as the Entscheidungsproblem, proving that there is no consistent, complete, and effectively calculable logic.

Church–Turing thesis: A hypothesis proposing that any function that can be naturally regarded as computable by a human being can be computed by a Turing machine, thereby defining the limits of what can be computed.

classical dilemma: A form of argument presenting two alternatives, both leading to the same conclusion, often used in classical rhetoric and logic to demonstrate inevitability.

classical logic: The traditional framework of logic based on principles of bivalence, non-contradiction, and excluded middle, primarily focusing on propositional and predicate logic.

classical reductio ad absurdum: A stronger form of reductio ad absurdum, where instead of only deriving $\neg P$ from showing that $P$ leads to a contradiction, one can also derive $P$ from showing that $\neg P$ leads to a contradiction.

coextensive: Having the same scope or range, especially referring to two terms or concepts that apply to the same set of objects.

cogent inductive argument: A where all the premises are true.

coherence theory of truth: A theory that holds truth as coherence among a set of beliefs or statements, rather than correspondence with reality or facts.

combinator: A function or expression in combinatory logic that acts on arguments to produce results without the need for variable bindings.

combinatorialism: Combinatorialism is the view that any arbitrary combination of elements constitutes a legitimate mathematical structure, whether that structure is definable or not.

combinatory logic: A branch of mathematical logic that seeks to eliminate the need for variables in mathematical expressions by using combinators.

combinatory terms: See.

commutativity: A property of binary operations where the order of the operands does not change the result, as in addition and multiplication in arithmetic.

compactness theorem: A theorem in logic stating that if every finite subset of a set of sentences has a model, then the entire set has a model.

complete infinity: A concept in philosophy and mathematics referring to an actual infinity that is considered as a completed whole, contrasting with potential infinities that are indefinitely extendable.

completeness: In logic, the property of a logical system whereby every logically valid formula can be derived using the system's axioms and inference rules.

complexity class: A classification of decision problems based on their inherent computational complexity, grouping problems that can be solved within similar resource constraints.

complexity theory: The study of the inherent difficulty of computational problems, focusing on the resources needed to solve them, such as time and memory.

composition: The act of combining simple objects or ideas into a complex whole, or the resulting combination itself.

compositionality: The principle in semantics that the meaning of a complex expression is determined by the meanings of its constituent expressions and the rules used to combine them.

compound formula: A formula representing a.

compound statement: A statement in logic that is formed by combining two or more statements with logical connectives, allowing for the construction of more complex statements from simpler ones.

comprehension schema: A principle in set theory and logic allowing for the formation of sets based on a defining property or condition.

computable function: A function for which there exists an algorithm that can compute the function's value for any valid input within a finite amount of time.

computation: The process of performing a sequence of calculations or logical operations systematically to obtain a result.

concept: An abstract idea representing the fundamental characteristics of what it describes.

conclusion: The statement that logically follows from the premises of an argument, serving as the argument's final claim.

concrete object: An object that exists in physical reality, as opposed to abstract objects which do not have a physical existence.

conditional: A logical connective that represents a "if... then..." relationship between two statements.

conditional logic: A branch of logic that studies the properties of the conditional connective and related logical concepts.

conditional probability: The probability of an event occurring given that another event has already occurred.

conditional proof: A method in logic for proving a conditional statement by assuming the antecedent and showing that the consequent follows.

conditionalization: The conditional obtained by taking the conjunction of the premises of the argument as antecedent and the conclusion of the argument as consequent. For instance, the conditionalization of modus ponens, $P \to Q, P \vdash Q$, is the formula $((P \to Q) \land P) \to Q$, called.

congruence relation: An equivalence relation that respects the operations of the algebraic structure it is defined on, such as addition or multiplication in a group.

conjunct: A component statement within a conjunction, each of which must be true for the entire conjunction to be true.

conjunction: A logical connective that represents the "and" relationship between two statements, requiring both to be true.

conjunction elimination: A rule of inference in propositional logic that allows one to infer a conjunct from a conjunction.

conjunction introduction: A rule of inference that allows the formation of a conjunction from two individual statements.

conjunctive normal form: A way of expressing a logical formula as a conjunction of clauses, where each clause is a disjunction of literals.

connected: A property of a graph in which there is a path between any two vertices, or a property of a topological space in which it cannot be divided into two disjoint nonempty open sets.

connexive logic: A branch of logic that studies principles of connection between propositions, such as the relation between a statement and its contrapositive.

consequence relation: A relation between sets of sentences or propositions, where the truth of the first set (the premises) necessitates the truth of the second set (the consequences).

consequent: The second part of a conditional statement, indicating the result or outcome if the antecedent condition is met.

consequentia mirabilis: A principle in classical logic stating that if the negation of a proposition leads to a contradiction, then the proposition itself must be true.

conservative extension: A property of a theory that is expanded by new axioms or rules without changing the truth values of statements in the original theory.

constant: A symbol in logic and mathematics that represents a fixed and unchanging value.

constant function: A function that always returns the same value, regardless of the input.

constructive dilemma: A form of argument where, given two conditional statements and evidence that at least one of their antecedents is true, one can conclude that at least one of the consequents is true.

constructive logic: A branch of logic that emphasizes the constructive proof of existence, requiring an explicit construction of an object to assert its existence rather than relying on indirect arguments.

constructive mathematics: A philosophy of mathematics that requires mathematical objects to be constructible and computable, rejecting non-constructive proofs such as those involving the law of excluded middle in its full generality.

constructive proof: A proof that demonstrates the existence of a mathematical object by providing a method to construct it explicitly, as opposed to proving indirectly by contradiction.

contextualism: The theory that the context in which an assertion is made is essential for understanding its truth conditions and meaning.

contingency: The property of being neither necessarily true nor necessarily false, depending on some conditions or on the state of the world.

contraction: In logic and mathematics, the process of eliminating duplicates in expressions or equations to simplify them.

contradiction: A statement or proposition that asserts both a statement and its negation, considered universally false in classical logic.

contradictory: Referring to a pair of statements or propositions where one is the negation of the other, such that they cannot both be true or both be false.

contraposition: A logical principle that states that a conditional statement is logically equivalent to its contrapositive, transforming "If P, then Q" into "If not Q, then not P".

contrapositive: The statement resulting from swapping the antecedent and consequent of a conditional statement and negating both, maintaining logical equivalence.

contrary: Referring to a pair of statements or propositions that cannot both be true, but can both be false.

convention T: A criterion of truth proposed by Alfred Tarski, stating that a sentence is true if and only if it corresponds to the facts or reality it describes.

converse: The statement formed by reversing the antecedent and consequent of a conditional statement, not necessarily maintaining logical equivalence.

converse domain: In set theory and logic, the set of all elements that are related to any element of a given set under a specific relation.

converse barcan formula: A principle in modal logic suggesting that possibility precedes existence, the converse of the Barcan formula.

conversion: The logical operation of swapping the subject and predicate of a categorical proposition, sometimes affecting its truth.

copula: The part of a proposition that links the subject to the predicate, typically represented by forms of the verb "to be".

co-referential: Referring to different expressions that denote the same object or entity in the world.

coreflexivity: A property of a binary relation where every element is related to itself, implying reflexivity.

corollary: A proposition that follows directly from another proposition or theorem with little or no additional proof.

correspondence theory of truth: The philosophical doctrine that the truth or falsity of a statement is determined by how it relates to the world and whether it accurately describes (corresponds with) that world.

counterexample: (broadly) An example that disproves a statement or proposition, showing that it is not universally true. (to an argument form) A counterexample to an argument form, or sequent, is an argument in the same logical form where the premises are clearly true but the conclusion is clearly false, showing that the form is invalid, since it lacks.

counterfactual conditional: A conditional statement (if...then...) concerning an event that did not actually happen but is considered for the sake of argument.

counterfactual logic: A branch of logic that studies counterfactual conditionals and their implications, often used in philosophical discussions about causality and decision theory.

countermodel: A countermodel of an argument is a model in which the premises are true and the conclusion false, showing that the argument is not valid.

counternecessary conditional: A conditional statement that considers a situation against a necessarily true backdrop, exploring implications in hypothetical scenarios that contradict necessary truths; also known as counterpossible.

counterpart theory: A philosophical theory proposed by Lewis that addresses the semantics of modal logic, suggesting that objects in possible worlds have counterparts in other possible worlds.

course of values recursion: A principle in mathematics and logic that defines a function based on the values it takes on smaller arguments, essential for defining functions like factorials and other recursive functions.

Curry paradox: A paradox in logic that arises when considering a statement that asserts its own unprovability, leading to contradictions in certain systems of formal logic.

cut: In proof theory, a rule or step in a deductive proof that introduces an intermediate conclusion, which is later used to derive further conclusions.

cut elimination: A procedure in proof theory that systematically removes cuts from a proof, simplifying it and showing that any result that can be proved with cuts can also be proved without them.

D
dagger: A name for the joint denial, or logical NOR.

decidable theory: A theory for which there exists a decision procedure, meaning that for any statement within the theory, it is possible to algorithmically determine whether the statement is true or false within the theory.

decision procedure: An algorithm or systematic method that can decide whether given statements are theorems (true) or non-theorems (false) in a logical system or mathematical theory.

de dicto: Referring to the way a statement attributes a property to a noun phrase as a whole, often contrasted with de re, which attributes a property to the thing itself.

deduction: The process of reasoning from one or more statements (premises) to reach a logically certain conclusion.

deduction theorem: A theorem stating that if a statement can be derived from a set of premises together with another statement, then the conclusion can be derived from the premises alone by adding the statement as a conditional.

deductive argument: An argument where the conclusion necessarily follows from the premises, intended to provide conclusive proof of the conclusion.

deductive consequence: See.

deductive validity: The property of a deductive argument where, if the premises are true, the conclusion must also be true. , where a proof follows from the rules of the formal system. (See .)

deductively equivalent: Two theories are deductively equivalent if they prove the same theorems.

deductivism: The philosophical stance that emphasizes deduction as the primary method of reasoning or acquiring knowledge.

definiendum: The term or phrase that is being defined in a definition.

definiens: The words or phrases that are used to provide the definition of the definiendum.

definite description: A phrase that uniquely identifies a particular individual or concept, often using "the" to specify uniqueness.

definition: A statement that explains the meaning of a term or concept, providing its essence or specifying its characteristics.

deflationism: A theory of truth that argues the role of the term "true" is merely to allow the expression of propositions that cannot be expressed otherwise, without implying a substantive property of truth.

degree-theoretic semantics: An approach in semantics where the truth of sentences is measured in degrees, rather than as strictly true or false, applicable in fuzzy logic and some theories of vagueness.

demonstration: See.

demonstrative: A word that indicates what object is being referred to, such as "this", "that", "him", "her", and "they".

De Morgan duality: The principle stating that the negation of a conjunction is equivalent to the disjunction of the negations, and vice versa, reflecting the duality between the logical operators AND and OR.

De Morgan negation: A de Morgan negation is a simple negation satisfying double negation elimination: $\neg A$ is false if and only if $A$ is true, and $\neg A$ is true if and only if $A$ is false.

De Morgan's rules: Two transformation rules stating that the negation of a conjunction is the disjunction of the negations, and the negation of a disjunction is the conjunction of the negations.

denotation: The direct reference or literal meaning of a word or phrase, as opposed to its connotation or implied meaning.

dense: A relation is dense if, for any two elements, there exists a third element that lies between them according to the relation.

denumerable: Equivalent to countably infinite; a set is denumerable if its elements can be put into a one-to-one correspondence with the natural numbers.

denying the antecedent: A logical fallacy in which the invalid argument form of "If P then Q, not P, therefore not Q" is used.

deontic modal logic: A branch of modal logic concerned with obligation, permission, and related modalities.

derivable rule: A rule that can be inferred from the axioms and inference rules of a logical system, as opposed to being an axiom or primitive rule of the system.

designated value: A semantic value that plays the same role for logical consequence as the role played by truth in classical logic, so that, for the consequence to hold, a designated value must be assigned to the conclusion if it is assigned to the premises.

destructive dilemma: A form of argument involving two conditional statements and their negated consequents, leading to the negation of at least one of the antecedents.

determiner: A word, phrase, or affix that specifies the reference of a noun or noun phrase, such as "the", "some", "every".

deterministic polynomial time: A complexity class (P) consisting of decision problems that can be solved by a deterministic Turing machine in polynomial time.

deterministic Turing machine: A theoretical computing machine that, for any given state and input symbol, has a single defined transition to a new state.

deviant logic: A term used to describe non-standard or alternative logical systems that deviate from classical logic.

diagonalization lemma: A lemma used in the proof of Gödel's incompleteness theorems, stating that for any formula with one free variable, there exists a sentence that asserts its own unprovability.

dialetheism: The belief that there are true contradictions, i.e., statements that are both true and false at the same time.

dialethic logic: A logic that allows for the existence of true contradictions, challenging the principle of non-contradiction.

dilemma: A situation in which a difficult choice must be made between two or more alternatives, often equally undesirable.

dilution: In logic, the weakening of a statement by adding disjunctive clauses that do not affect the original statement's truth.

directed: A relation is directed if, for every pair of elements, there is a third element related to both, ensuring a kind of coherence or consistency within the set.

discharge: The act of eliminating an assumption in a logical derivation, often by using it to prove a conditional statement.

disjunct: One of the component propositions in a disjunction, each of which is an alternative to the others.

disjunction: A logical connective that represents the "or" relationship between two statements, requiring at least one to be true.

disjunction elimination: A rule of inference that allows deriving a conclusion from a disjunction and conditional statements—if $P \lor Q$ and both $P \rightarrow R$ and $Q \rightarrow R$, then $R$.

disjunction introduction: A logical principle allowing the introduction of a disjunction from any single proposition— from $P$, infer $P \lor Q$.

disjunction property: A property in intuitionistic logic stating that if a disjunction $P \lor Q$ is provable, then either $P$ is provable or $Q$ is provable.

disjunctive normal form: A standardization of logical formulae in which a formula is expressed as a disjunction of conjunctive clauses.

disjunctive syllogism: A form of deductive reasoning that concludes one disjunct must be false if the other is true and a disjunction is given (if $P \lor Q$ and not $P$, then $Q$).

disquotationalism: A theory of truth that focuses on the disquotation principle, which suggests that the function of the truth predicate is to remove quotation marks to form equivalent sentences.

distribution: A term is distributed within a categorical proposition if, and only if, that proposition says something about all objects instantiating that term.

distribution axiom: In modal logic, the axiom (called K) that $□(p → q) → (□p → □q)$. In epistemic modal logic, the axiom (also called K) that $(K_i\varphi \land K_i(\varphi \implies \psi)) \implies K_i\psi$.

distributive laws: See.

distributive predication: A property of predicates in logic that allows them to be applied to each element of a subject class individually rather than to the class as a whole.

distributivity: The characteristic of certain binary operations to be able to distribute over others in a specific algebraic structure, maintaining equivalence.

division: See.

domain: The set of all possible inputs for a function, or more generally, the subject matter or universe of discourse in a logical argument.

domain of discourse: The collection of objects being discussed in a particular logical context, which determines the range of quantifiers.

dominant connective: The connective with the largest in a formula.

double negation: The application of negation twice to a proposition, which in classical logic results in the original proposition ($\neg \neg P \equiv P$).

double negation elimination: A principle in classical logic stating that the double negation of a statement can be removed without changing its truth value ($\neg \neg P$ is equivalent to $P$).

double negation introduction: The principle that for any proposition $P$, $P$ implies $\neg \neg P$, reinforcing the assertion of $P$ by denying its negation.

double turnstile: A symbol ($\models$) used in logic to denote semantic entailment or logical consequence, indicating that the truth of some propositions necessitates the truth of another.

downward Löwenheim–Skolem theorem: Part of the.

doxastic modal logic: A branch of modal logic that deals with the logic of belief, modeling the beliefs of rational agents.

dual: The dual of a truth-table is obtained by interchanging the truth values "true" and "false" (or 0 and 1) throughout the table. Connectives are dual if their truth-tables are dual: conjunction and disjunction are dual, and negation is self-dual. The dual of a formula is obtained by replacing each connective by its dual, e.g., for a formula containing only conjunction, disjunction, and negation (such as a formula in disjunctive normal form), its dual is the result of replacing each conjunction with a disjunction, and each disjunction with a conjunction. (For a formula in disjunctive normal form, its dual is a formula in conjunctive normal form.)

dynamic modal logic: A branch of modal logic that studies necessary and possible connections between events.

E
effective procedure: A method or process that guarantees a solution to a particular problem or class of problems, typically through a finite number of steps that can be precisely followed.

effectively computable function: A function for which there exists an algorithm or mechanical procedure that can compute the function's value for any valid input in a finite amount of time.

effectively decidable relation: A binary relation for which there exists a mechanical method to determine, for any given pair of elements, whether the relation holds between them.

effectively decidable theory: A theory in which there exists an algorithm capable of determining whether any given statement within the theory is true or false.

elementary equivalence: A relationship between two structures in logic and mathematics where they satisfy the same first-order sentences.

elimination of quantifiers: A process in logical deduction where quantifiers are removed from logical expressions while preserving equivalence, often used in the theory of real closed fields.

elimination rule: A rule in logical inference that allows the derivation of simpler formulas from more complex ones, often by removing logical connectives or quantifiers.

empty concept: A concept that does not have any instantiation in reality or does not refer to any existing object or group of objects.

endomorphism: A function from a mathematical object to itself that preserves the object's structure.

entailment: The logical relationship where the truth of one set of statements (the premises) necessitates the truth of another statement (the conclusion).

enthymeme: A rhetorical argument that is presented with one or more premises left implied rather than explicitly stated.

Entscheidungsproblem: The decision problem, a challenge posed by David Hilbert asking for an algorithm to determine the truth or falsity of any given mathematical statement. The problem was proven to be unsolvable by Alan Turing and Alonzo Church.

Epimenides paradox: A self-referential paradox involving a statement made by Epimenides, a Cretan, who stated that all Cretans are liars, leading to a logical contradiction if taken to be true.

epimorphism: A morphism in category theory that is right-cancellable, meaning it behaves like a surjective function in the context of sets.

epistemic constraint: The principle that truths must be knowable. It is brought up in the context of verificationism and Fitch's paradox of knowability.

epistemic modal logic: A branch of modal logic that deals with reasoning about knowledge and belief, using modalities to express what is known and what is believed.

epistemic paradox: A paradox arising from basic intuitions regarding knowledge, belief, or related epistemic notions. For instance, the and the.

epistemic vagueness: The view that vagueness is a feature of human knowledge, rather than of the world or of language. Contrast and.

epistemicism: The philosophical position that there are truths that cannot be known, typically applied to discussions of vagueness and the sorites paradox.

E-proposition: In traditional logic, a universal negative categorical proposition, stating that no members of one class are members of another class.

equivalence: See, ,.

equivalence relation: A binary relation that is reflexive, symmetric, and transitive, indicating that elements it relates are in some sense "equivalent."

equivalent: See, ,.

equivocation: A logical fallacy involving the use of a word with more than one meaning throughout an argument, leading to a misleading or unsound conclusion.

erotetic logic: The logic of questions, including the study of the forms and principles of questions and their relationships to answers.

Eubulides paradox: A paradox presented by Eubulides of Miletus, including the liar paradox, which involves a statement declaring itself to be false, creating a contradiction.

Euclidean: A relation R where, for any objects x, y, and z, it is true that if Rxy and Rxz, then Ryz.

exchange: See.

excluded middle: The principle that for any proposition, either that proposition is true or its negation is true, with no middle ground.

exclusion negation: In three-valued logic, form of negation that strictly excludes the possibility of something being true, as opposed to constructive negation which asserts the truth of an opposite proposition.

exclusive disjunction: A logical operation that is true if and only if exactly one of its operands is true, also known as "xor" or "exclusive or."

exclusive or: A binary logical operation that returns true only when the inputs are different; symbolized as XOR or $\oplus$.

ex falso quodlibet: A principle in classical logic stating that from a falsehood, any conclusion can be derived, also known as the principle of explosion.

existence predicate: A predicate, usually occurring in free logics, that asserts the existence of the referent of a constant.

existential generalization: A rule of inference allowing the conclusion that something exists with a certain property, based on the existence of a particular example.

existential import: The implication that something exists by the assertion of a particular kind of statement, especially relevant in traditional syllogistic logic.

existential instantiation: A logical rule that allows one to infer the existence of a particular individual from a statement asserting the existence of such an individual generically.

existential introduction: A rule of inference that introduces an existential quantifier, asserting the existence of at least one entity that satisfies a given property.

existential quantifier: A quantifier used in predicate logic to indicate that there exists at least one member of the domain for which the predicate holds true.

existential variable: A variable in predicate logic that is bound by an existential quantifier, representing an unspecified member of the domain that satisfies the predicate.

explanandum: The statement or phenomenon that is being explained in an explanation.

explanans: The statement or set of statements that provide the explanation for the phenomenon or statement referred to by the explanandum.

explanation: The act of clarifying, elucidating, or making something understandable through detailing reasons, causes, or justifications.

explicit definition: A definition that provides a means for replacing each occurrence of the with an appropriate instance of the. Contrast.

explosion: The principle in logic that from a contradiction, any statement can be proven, related to the principle of ex falso quodlibet.

exportation: A logical principle that transforms a statement of the form $(P \land Q) \rightarrow R$ into the equivalent form $P \rightarrow (Q \rightarrow R)$, essentially redistributing the logical operations.

expressive completeness: Synonym of functional completeness.

extension: The collection of objects or entities to which a term or concept applies, contrasted with its intension, which refers to the properties or characteristics defining those objects or entities.

extensional logic: A form of logic where the truth of sentences and arguments depends solely on the extension of the terms involved, disregarding their intension or conceptual content.

F
factivity: The property of certain expressions or verbs that implies the truth of the propositions they refer to, often used in the context of knowledge and belief.

fallacy: An error in reasoning that results in an invalid argument or one that is not logically sound.

fallacy of composition: The logical error of assuming that what is true of the parts must also be true of the whole.

fallacy of division: The logical error of assuming that what is true of the whole must also be true of its parts.

fallacy of four terms: A logical fallacy in syllogistic logic where a syllogism includes four (rather than the requisite three) distinct terms, making the argument invalid.

false dichotomy: An informal fallacy that presents two options as the only possibilities when in fact more possibilities exist.

false dilemma: A form of false dichotomy where two choices are presented as the only options when other alternatives are available, often used to force a decision.

falsemaker: An entity or set of conditions that makes a proposition false. In metaphysics, it's considered the counterpart to a truthmaker, which validates the truth of a proposition.

falsity: The quality or condition of being false or untrue.

falsum: A symbol used in logic to represent falsity or a contradiction, often denoted as $\bot$.

"Fido"-Fido principle: The principle in philosophy of language suggesting that the meaning of a word is the object it refers to, exemplified by the idea that the meaning of "Fido" is the dog Fido itself.

field: The field of a function is the union of the domain and range of that function.

figure: See.

finitary: Pertaining to methods or processes that involve a finite number of steps or elements.

finitary arithmetic: An approach to arithmetic focusing on finitary methods, avoiding infinities and emphasizing constructions that can be completed in a finite number of steps.

finitary formal system: A formal system in which all operations, proofs, and expressions are finitary, relying only on objects that can be constructed or demonstrated in a finite number of steps.

finite character: The property of certain mathematical or logical systems where every relevant feature or property can be determined by examining only a finite part of the system.

finite model theory: A branch of model theory that deals with the study of properties of structures (models) that have a finite domain.

finitely axiomatizable: Referring to a theory that can be fully captured by a finite set of axioms.

finitism: A philosophical view that rejects the existence of infinite entities and infinite processes, emphasizing only those quantities or procedures that are finite.

first-degree entailment (FDE): A logical system that allows for the existence of both true and false atomic propositions but does not require every proposition to be either true or false, rejecting the law of the excluded middle for certain propositions.

first-order logic: A formal logical system involving quantifiers "for all" and "there exists," which can quantify over individuals but not over predicates or functions.

first-order theory: A theory expressed in first-order logic, dealing with the relationships between individuals and properties or relations that individuals may have.

first-order variable: A variable in first-order logic that represents an individual in the domain of discourse.

Fitch paradox: A paradox in epistemic logic that arises from seemingly reasonable assumptions about knowledge and leads to the conclusion that all truths are known.

fixed point: In mathematics and logic, a value or element that is mapped to itself by a particular function or operation.

forced march sorites: A type of sorites paradox involving a series of incremental steps or changes that lead to a contradiction, challenging the precision of vague predicates by forcing a march from one end of a spectrum to another.

formal consequence: A conclusion that follows in virtue of alone, as distinguished from a, which (also) depends on the content of the propositions. See also.

formal fallacy: A logical error in the form or structure of an argument, as opposed to a material fallacy which relates to the argument's content.

formal language: A set of strings of symbols that are constructed according to specific syntactic rules, used in mathematics, computer science, and formal logic to precisely define expressions without ambiguity.

formal logic: The study of inference with purely formal content, where no interpretation is given to the terms and only the logical form is considered.

formal proof: A proof in which each step is justified by a rule of inference, constructed within a formal system to demonstrate the truth of a proposition.

formal semantics: The study of how formal systems, especially those used in logic and linguistics, are connected to conceptual or referential interpretations.

formal system: A system of symbols and rules for manipulating these symbols, used to derive statements or theorems in a logical or mathematical domain.

formation rules: Rules that specify the correct ways in which the basic symbols of a formal language can be combined to form well-formed formulas.

formula: An expression in a formal language that can be evaluated as true or false within a given interpretation, often involving variables and logical connectives.

frame: In modal logic, a structure consisting of a set of possible worlds and a relation between those worlds, used to interpret modal propositions.

frame semantics: A theory in linguistics and logic that uses frames—conceptual structures for representing stereotypical situations—as a means of understanding how language conveys meaning.

free choice sequence: A sequence (typically of natural numbers) where each term is chosen freely, not determined by any rule or algorithm, often used in discussions of constructivism and intuitionism.

free logic: A form of logic that allows for terms that do not denote any existing object, differing from classical logic by not requiring every term to refer to something in the domain of discourse.

free variable: A variable in a formula that is not bound by a quantifier and does not have a specific value assigned to it within the context of the formula.

Frege's theorem: A result in logic and mathematics demonstrating that arithmetic can be derived from logic through the introduction of the concept of a successor and the use of second-order quantification.

function: A relation between sets that associates every element of a first set with exactly one element of a second set, often represented as a mapping from elements of one set to elements of another.

fuzzy logic: A many-valued logic which allows for degrees of truth and certainty.

G
gambler's fallacy: The erroneous belief that if an event occurs more frequently than normal during the past, it is less likely to happen in the future (or vice versa), often arising in contexts of gambling and misinterpretation of statistics.

game-theoretic semantics: An approach to semantics that interprets the meaning of linguistic expressions through the outcomes of certain idealized games played between a verifier and a falsifier, emphasizing the interactive process of establishing truth or falsehood.

gap: See.

Geach-Kaplan sentence: A type of sentence that raises issues in the philosophy of language and logic regarding context-dependence, referential opacity, and the limits of formal semantic analysis. Named after philosophers Peter Geach and David Kaplan.

generalized quantifier: In logic and linguistics, a quantifier that can express more complex relationships than standard quantifiers like "all" or "some," allowing for the expression of concepts like "most," "many," and "few."

Glivenko's theorem: A result in logic stating that if a formula is provable in classical logic, then its double negation is provable in intuitionistic logic, establishing a connection between the two logics.

glut: See.

Gödel numbering: A method of encoding mathematical and logical symbols and expressions as natural numbers, introduced by Kurt Gödel as part of his incompleteness theorems.

Gödel sentence: A self-referential sentence constructed in formal systems to demonstrate Gödel's incompleteness theorems, asserting its own unprovability within the system.

Gödel-Dummett logic: A form of intuitionistic logic that includes a principle of maximal elements, allowing for the expression of certain intermediate truth values between true and false.

Gödel's first incompleteness theorem: A theorem proving that in any consistent formal system that is capable of expressing basic arithmetic, there are propositions that cannot be proven or disproven within the system.

Gödel's second incompleteness theorem: A theorem establishing that no consistent system capable of doing arithmetic can prove its own consistency, building on the first incompleteness theorem.

Gödel's slingshot argument: An argument concerning the semantics of reference and truth, challenging the coherence of theories that attempt to distinguish between facts and true propositions in a fine-grained manner.

Grelling paradox: A paradox related to self-reference and linguistic categories, particularly whether the word "heterological," meaning not applicable to itself, applies to itself.

H
halting problem: The decision problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running or continue to run forever. Proven to be undecidable by Alan Turing.

harmony: In logic and philosophy, the notion that the introduction and elimination rules for a logical connective should be in balance, ensuring that the connective does not introduce more than it can eliminate, and vice versa.

hasty generalization: An informal fallacy in which a conclusion is not logically justified by sufficient or unbiased evidence; drawing a general conclusion from a too-small sample size.

Henkin semantics: A generalization of standard first-order semantics that allows for models where the range of quantifiers can be restricted, named after Leon Henkin.

Henkin sentence: A sentence that asserts its own provability, possibly by applying the to itself.

hereditary property: A property of objects in a mathematical or logical structure that, if applied to an object, also applies to all subobjects or elements of that object.

heterological: Describing an adjective that does not apply to itself. For example, "long" is not long, so "long" is heterological.

hierarchy: A system in which entities are ranked one above the other based on certain criteria, often used in the context of sets, classes, or organizational structures. In logic, an important one is. In set theory, an important one is the cumulative hierarchy.

higher-order logic: A form of logic that extends first-order logic by allowing quantification over predicates and possibly other higher-order entities, not just individuals.

higher-order quantifier: A quantifier that binds a.

higher-order vagueness: Vagueness about the application of the concept of vagueness itself, particularly in the context of predicates that are borderline cases of borderline cases.

higher-order variable: A variable in higher-order logic that represents a function, predicate, or relation, rather than an individual object.

Hilbert's program: An ambitious project proposed by David Hilbert to provide a solid foundation for all of mathematics by formalizing it and proving it consistent using finitary methods.

holism: The idea that systems and their properties should be analyzed as wholes, not just as a collection of parts, often discussed in the context of meaning, knowledge, and the philosophy of science.

homomorphism: A structure-preserving map between two algebraic structures of the same type, such as groups, rings, or vector spaces, that respects the operations of the structures.

horn: Refers to either of the two alternatives presented by a dilemma.

Hume's principle: The principle that the number of objects in one collection is equal to the number of objects in another collection if and only if there is a one-to-one correspondence between the two collections.

hybrid logic: A type of modal logic that incorporates additional syntactic elements to refer directly to worlds in its models, allowing for more expressive power than standard modal logics.

hypothetical syllogism: A form of logical argument consisting of three propositions: two conditional statements and a conclusion that infers a relationship between the antecedent of the first conditional and the consequent of the second.

I
idempotent: A property of certain operations in which applying the operation multiple times has the same effect as applying it once. For example, the union of a set with itself is the set itself.

identity: The relation that each entity bears only to itself; or, the principle that an entity is the same as itself.

identity function: A function that always returns its input as its output, for any given input.

identity of indiscernibles: A principle stating that if two entities share all their properties, they must be identical.

iff: An abbreviation for "if and only if," denoting a biconditional logical connective indicating mutual implication.

ignoratio elenchi: A logical fallacy where an argument misses the point or addresses an issue different from the one that was raised, also known as missing the point.

image: The set of all outputs of a function from a given set of inputs.

immediate inference: A process of reasoning in which a conclusion is directly derived from a single premise without any intermediary steps.

imperative: A type of linguistic expression or logical form that expresses a command, request, or instruction.

imperative logic: A branch of logic that studies the formal properties of imperatives or commands, distinct from indicative statements.

implication: A logical relation where the truth of one statement (the antecedent) brings about the truth of another statement (the consequent).

implicit definition: A definition that specifies an entity or concept not by direct enumeration of its properties but by its relations to other entities or concepts.

impossibility: The state or condition of something being not possible, either logically or physically.

impossible world: A hypothetical construct in modal logic representing a way things could not possibly be, used to explore concepts of necessity and possibility.

impredicative definition: A definition that refers to a set that includes the entity being defined, often leading to paradoxes in naive set theories.

inclusive disjunction: A logical operation that returns true if at least one of its operands is true; corresponds to the logical OR.

inclusive first-order logic: A variant of first-order logic that allows for empty domains, in contrast to the standard requirement that domains contain at least one object.

inclusive or: The disjunction operation in logic that is true if either or both of its operands are true.

incompleteness: The property of a logical or mathematical system where not all truths within the system can be proven using the system's rules.

incompleteness theorem: Gödel's theorem stating that any consistent formal system capable of expressing basic arithmetic cannot be both complete and consistent.

inconsistency: The state of containing contradictory elements, which cannot all be true at the same time within a logical framework.

inconsistent arithmetic: An arithmetic system in which a contradiction can be derived, violating the principle of consistency.

indefinite description: A description that does not uniquely identify a single individual or entity but refers to any member of a class that satisfies a certain condition.

indefinite extensibility: The concept that certain collections (such as the set of all sets) cannot be comprehensively listed because any attempt to enumerate them leads to the possibility of generating new members.

independence result: A finding in logic and mathematics that a particular statement cannot be proven or disproven within a given system, assuming the system's axioms are consistent.

independence-friendly logic: A logic that extends first-order logic to allow for more nuanced expressions of quantifier scope and dependence, particularly in contexts of game-theoretical semantics.

independent: Referring to a pair of propositions that are not,, , , or implied one by the other (either the first by the second, or the second by the first).

indeterminacy of translation: Inition proposed by W.V.O. Quine, suggesting that no unique translation between languages can be determined solely by empirical evidence, due to the underdetermination of theories by data.

indexical: A type of expression whose reference can shift based on the context in which it is used, such as "I," "here," and "now."

indicative conditional: A conditional statement used to express factual implications or predictions about real situations, as opposed to counterfactual or hypothetical statements.

indirect proof: A method of proof in which the negation of the statement to be proven is assumed, and a contradiction is derived, thereby proving the original statement by contradiction.

indiscernibility: The inability to distinguish between objects due to them sharing all properties, related to the principle of identity of indiscernibles.

indiscernibility of identicals: The principle stating that if two entities are identical, then they share all the same properties.

indispensability argument: An argument suggesting that if a mathematical entity is indispensable to our best scientific theories, then we ought to commit to its existence.

individual: An entity regarded as indivisible or atomistic in nature, often discussed in the context of metaphysics, logic, and the philosophy of language.

induction: See,, , , ,

induction on well-formed formulas: A method used in formal logic and mathematics to prove properties of all well-formed formulas by showing they hold for basic formulas and are preserved under the operations that generate new formulas.

induction schema: Synonym of mathematical induction.

inductive argument: An argument that provides probable support for its conclusion, as opposed to deductive arguments which provide conclusive support.

inductive proof: A proof method used in mathematics to prove statements about all natural numbers or other well-ordered sets, based on the principle of induction.

inductive step: In an inductive proof, the step that shows if a property holds for an arbitrary element $n$, it also holds for the next element $n+1$.

inference: The process of deriving logical conclusions from premises known or assumed to be true.

inference rule: A logical rule that outlines the conditions under which certain conclusions can be validly drawn from premises.

inference to the best explanation: A form of abductive reasoning that suggests we should accept the hypothesis that best explains the relevant evidence.

inferentialism: The philosophical view that the meaning of a statement is determined by the rules governing its use and the inferences that can be drawn from it.

infinitary: Pertaining to operations, languages, or logics that allow expressions of infinite length, such as infinitary logic.

infinitesimal: A quantity that is closer to zero than any positive real number, yet not zero, used in non-standard analysis.

infix notation: A notation in which the operator is placed between the operands, as in standard arithmetic expressions.

informal fallacy: A flaw in reasoning that occurs in natural language arguments due to ambiguity, irrelevance, or other factors outside the formal structure of the argument.

injection: A function that maps distinct elements of its domain to distinct elements of its codomain, also known as an injective function or one-to-one function.

injective: Describing a function in which each element of the codomain is mapped to by at most one element of the domain.

inner model: An inner model of a theory is a model that is obtained by taking a substructure of another model.

in rebus vagueness: The view that vagueness is a feature of the world, rather than of language or of human knowledge. Contrast and. See also.

insolubilia: Unsolvable problems or paradoxes, especially those related to self-reference and logical contradiction, such as the liar paradox.

instantiation: The process of replacing bound variables with constants, eliminating the quantifiers that had bound them.

intended interpretation: The standard or conventional meaning assigned to the symbols and expressions of a formal language within a particular context or theory.

intension: The inherent content or essential properties and meanings of a concept or term, as opposed to its extension, which refers to the range of things it applies to.

intensional definition: A definition that specifies the essential properties of the term being defined, focusing on the concept's intension rather than its extension.

intensional logic: A logic that deals with the intensional aspects of meaning, such as belief, necessity, and possibility, distinguishing between logically equivalent expressions that have different modal properties.

intermediate logic: Any logical system that falls between intuitionistic logic and classical logic in strength, allowing for distinctions not permissible in classical logic.

interpolation theorem: A result stating that if a formula $A \rightarrow B$ is provable, then there exists a formula $C$ containing only the non-logical symbols common to $A$ and $B$ such that $A \rightarrow C$ and $C \rightarrow B$ are both provable.

interpretation: The assignment of meanings to the symbols and expressions of a formal language, or the way a particular set of terms is understood or construed.

interrogative: Pertaining to questions or the act of questioning.

interrogative logic: See.

introduction rule: In logic, a rule that allows for the introduction of a connective into a proof, defining how that connective can be logically inferred.

intuitionism: A philosophy of mathematics that denies the reality of the mathematical infinite and the completeness of mathematical truth, requiring constructive proofs.

intuitionistic logic: A system of logic that reflects the principles of intuitionism, rejecting the law of excluded middle and requiring more constructive proofs of existence.

intuitionistic mathematics: Mathematics based on intuitionistic logic, emphasizing constructive methods and rejecting non-constructive principles like the law of excluded middle.

invalid: Referring to an argument whose conclusion does not logically follow from its premises.

invalid deductive argument: A deductive argument that fails to provide conclusive support for its conclusion, due to a flaw in logical structure.

inverse: A operation or function that reverses the effect of another operation or function.

involution: An operation that is its own inverse, meaning applying it twice returns to the original state.

I-proposition: In traditional logic, a particular affirmative categorical proposition, stating that some members of the subject class are members of the predicate class.

irreflexivity: A property of a relation where no element is related to itself.

"is" of identity: The use of the verb "is" to denote numerical identity between two entities.

"is" of predication: The use of the verb "is" to signify that a property or characteristic is attributed to a subject.

island of knights and knaves: A fictional scenario used in logic puzzles where inhabitants are either knights, who always tell the truth, or knaves, who always lie, posing challenges to deductive reasoning.

isomorphism: A bijective (one-to-one and onto) correspondence between two structures that preserves the operations and relations of the structures, indicating they have the same form or structure.

iteration: The process of repeating a set of operations or a procedure multiple times, each time applying it to the result of the previous step.

iteration theorem: Synonym for the $S n m$ theorem.

J
joint denial: A logical connective in propositional logic, equivalent to the nor operator, that is true if and only if both propositions it connects are false. It denies the joint assertion of both propositions.

K
K3: The three-valued logic K3, due to Stephen Cole Kleene.

Kleene connectives: Logical connectives defined using Kleene's three-valued logic, which includes a third truth value (undefined or unknown) in addition to true and false, accommodating indeterminate propositions.

knaves: In logic puzzles, individuals who always lie. Used in scenarios like the island of knights and knaves to explore logical deduction.

knights: In logic puzzles, individuals who always tell the truth. They are used alongside knaves in scenarios that challenge deductive reasoning.

knowability paradox: A paradox arising from the assumption that if a statement is true, then it is possible to know that it is true, leading to contradictions in certain epistemic frameworks.

knower's paradox: A paradox related to self-reference and epistemic logic, typically involving a statement that claims its own unprovability or unknowability.

Kreisel-Putnam logic: A logic developed to handle higher-order quantification and modalities, reflecting discussions on the foundations of mathematics by Kreisel and Putnam.

Kripke semantics: A framework for interpreting modal logic through the use of possible worlds, developed by Saul Kripke, allowing for the formal analysis of necessity, possibility, and other modal notions.

Kripke structure: A mathematical structure used in modal logic and computer science to model systems that can be in various states and transition between them, forming the basis for Kripke semantics.

L
lambda-calculus: A formal system in mathematical logic and computer science for expressing computation based on function abstraction and application, using variable binding and substitution.

Lambek calculus: A mathematical system for modeling the syntax of natural languages, based on categorial grammar, emphasizing the role of operations and types.

language: A system of communication that enables humans to cooperate, express ideas, emotions, and, in the context of formal languages, to construct and convey precise meanings. See,, , , ,.

law of non-contradiction: A fundamental principle of classical logic stating that contradictory statements cannot both be true in the same sense at the same time.

left field: See.

Leibniz's Law: The principle of the identity of indiscernibles, stating that if two entities share all the same properties, then they are identical.

lemma: A proposition proved or assumed to be true, used to prove other propositions or theorems.

liar paradox: A self-referential paradox involving a statement that declares itself to be false, leading to a contradiction if it is either true or false.

liar sentence: A sentence that asserts its own falsity, such as "This sentence is false," which creates the basis for the liar paradox.

limitation result: A result that establishes a boundary or limit on what can be achieved within a particular logical or mathematical system, often related to incompleteness or undecidability.

linear logics: A subfield of logic that emphasizes the concept of resources, where logical operations consume their arguments, differing from classical logic's treatment of assumptions as reusable.

linear order: A total order on a set where every pair of elements is comparable, meaning for any two elements, one is either greater than, less than, or equal to the other.

linear ordering: Another term for linear order, emphasizing the arrangement of elements in a sequence where each is comparable to the others in a single, unambiguous way.

Löb paradox: A paradox in modal logic that arises from attempting to formalize a statement's provability within the system, leading to conclusions that appear counterintuitive or self-contradictory.

Löb's theorem: A theorem in mathematical logic that provides conditions under which a statement about its own provability is provable, related to Gödel's incompleteness theorems.

logic: The systematic study of the form of valid inference, including the structures that allow or compel particular conclusions given certain premises.

logic gate: A physical device implementing a Boolean function, used in digital circuits to perform logical operations on one or more binary inputs to produce a single binary output.

logical machine: A mechanical device for performing formal logic such as the Stanhope Demonstrator or Jevon's logic piano.

logic of attributes: See.

logic of conditionals: See.

Logic of Paradox: A logical system that allows for some contradictions to be true, challenging the traditional law of non-contradiction and exploring the consequences of paradoxical statements.

logic of questions and answers: See.

logic of relations: A branch of logic that deals with the study of relations, including their properties, composition, and inversion, and how they interact with logical operators.

logic of weak excluded middle: An intermediate logic obtained by adding all instances of to propositional logic. Also called "KC" and "Jankov's logic".

logical antirealism: The philosophical position that logical truths do not correspond to an independent reality but are instead products of human conventions, language, or thought processes.

logical connective: A symbol or word used in logic to connect propositions or sentences, forming more complex expressions that convey relationships such as conjunction, disjunction, and negation.

logical consequence: A relationship between statements where the truth of one or more premises necessitates the truth of a conclusion, based on the logical structure of the statements. See and.

logical constant: A symbol in logic that has the same meaning in all interpretations, such as connectives and quantifiers, as opposed to variables whose interpretations can vary.

logical equivalence: The relationship between statements that are true under exactly the same conditions, allowing them to be substituted for one another in logical proofs.

logical falsehood: A statement that is false under all possible interpretations, also known as a contradiction.

logical form: The abstract structure of a statement or argument, representing the logical relationships between its components independent of the specific content.

logical implication: The logical relationship that holds between propositions when the truth of one (the antecedent) guarantees the truth of another (the consequent).

logical monism: The philosophical position that there is only one correct logic or logical system that accurately captures the principles of valid reasoning.

logical operator: A symbol or function in logic that applies to one or more propositions, producing another proposition that expresses a logical operation such as negation, conjunction, or disjunction.

logical paradox: A statement or group of statements that lead to a contradiction or a situation that defies intuition, often highlighting limitations or problems within the logical system. Sometimes distinguished from.

logical pluralism: The view that there are multiple equally correct logics or systems of logic that capture different aspects of reasoning or argumentation.

logical structure: See.

logical theorem: A proposition that has been proven to be true within a specific system of logic, based on the system's axioms and inference rules.

logical truth: A statement that is true in all possible worlds or under all possible interpretations, due to its logical form rather than the content of its terms.

logical validity: The property of an argument wherein if the premises are true, the conclusion necessarily follows, due to the structure of the argument rather than the specific nature of the premises or conclusion.

logically equivalent: Referring to statements that have the same truth value in every possible scenario, indicating that they are interchangeable in logical reasoning.

logicism: The philosophical belief that mathematics can be reduced to logic and that all mathematical truths can be derived from logical axioms and definitions.

Löwenheim–Skolem theorem: A theorem in mathematical logic that states any countable theory with an infinite model has models of all infinite cardinalities, highlighting the limitations of first-order logic in controlling the sizes of its models.

LP: See.

M
main connective: See.

main operator: See.

major connective: See.

major premise: The premise in a syllogism containing the major term, which is the predicate of the conclusion.

major term: The term that appears as the predicate in the conclusion of a syllogism.

many-sorted logic: A variant of first-order logic that allows for multiple domains of discourse, with variables and quantifiers distinguished by the sort or type of objects they range over.

many-valued logic: A logical system that extends beyond classical two-valued true/false logic to include additional truth values, accommodating indeterminacy, uncertainty, or levels of truth.

markov's principle: A principle in constructive mathematics stating that if it is impossible for a mathematical object not to have a certain property, then there exists an object with that property.

material biconditional: A logical connective that is true if and only if both operands have the same truth value, also known as the "if and only if" operator.

material conditional: A logical connective typically represented by "if...then...", which is true unless the antecedent is true and the consequent is false.

material consequence: The relationship between statements where the truth of one (the antecedent) results in the truth of another (the consequent), based on the content of the statements rather than their. Contrast. See also. Not to be confused with.

material equivalence: The relation between propositions that hold the same truth value; their truth or falsity under all possible conditions is identical.

material implication: Another term for material conditional, emphasizing the implication based on the substantive content of the propositions involved.

materially equivalent: Describing propositions that are true under exactly the same conditions or have the same truth value across all possible worlds.

mathematical abstractionism: A philosophical stance that views mathematical entities as abstractions from physical objects or properties, rather than as inherently existing objects.

mathematical induction: A method of proof used in mathematics to prove statements about natural numbers, based on proving a base case and an inductive step.

mathematical induction schema: Synonym of mathematical induction.

mathematical logic: The study of logic within the framework of mathematical reasoning, focusing on the mathematical properties of logical systems.

matrix: The quantifier-free part of a formula in prenex normal form.

maximal consistent set: A set of formulas in a logical system that is consistent (no contradictions can be derived from it) and maximal (no additional formulas can be added without causing inconsistency).

Meinongianism: A philosophical theory that posits the existence of non-existent objects, named after Alexius Meinong, challenging traditional ontological categories.

mention: In philosophy, especially in discussions of language, "mention" involves referencing a word or phrase itself rather than employing it for its semantic content. This typically occurs when discussing the word as a linguistic entity. In the use-mention distinction, "mention" is signified by the use of quotation marks or other indicators that the words are subjects of discussion rather than tools for communication. For example, in the sentence "The word 'books' consists of five letters," "books" is mentioned, not.

mere possibilia: Hypothetical or possible entities that do not actually exist but could exist under different circumstances.

metalanguage: A language used to describe, discuss, or analyze another language (the object language), especially in the context of logic and linguistics.

metalogic: The study of the properties of logical systems and languages, including their consistency, completeness, and decidability.

metamathematics: The branch of mathematics that studies mathematical systems and theories from a higher-level perspective, often using methods from mathematical logic.

metatheorem: A theorem about a mathematical theory or logical system, stating properties or results about the system itself.

metatheory: The theoretical analysis of mathematical theories or logical systems, focusing on their properties, structure, and foundations.

middle term: In a syllogism, the term that appears in both premises but not in the conclusion, serving as a link between the major and minor terms.

minimalism: A view of truth, according to which all instances of Tarski's are trivially (or analytically) true.

minimization: In recursive function theory, the operation of searching for the smallest witness to a decidable predicate.

minor premise: The premise in a syllogism that includes the minor term, which is the subject of the conclusion.

minor term: The term that appears as the subject in the conclusion of a syllogism.

modal actualism: The philosophical position that only actual, existing objects are possible, denying the existence of merely possible objects.

modal agnosticism: A stance of neutrality or skepticism regarding the truth of modal propositions, especially concerning necessity and possibility.

modal fictionalism: The view that modal statements (about possibility and necessity) can be treated as useful fictions without committing to the existence of possible worlds.

modal logic: A branch of logic that deals with modalities such as necessity, possibility, and related concepts, often formalized through the use of modal operators.

modal operator: A logical operator that modifies the truth value of a statement by expressing modality, such as necessity ($\Box$) or possibility ($\Diamond$).

modal possibilism: The view that possible but non-actual entities exist in some sense or in possible worlds, in contrast to actualism.

modal realism: The philosophical position that possible worlds are as real as the actual world, and that individuals can exist across different possible worlds.

modality: A quality of propositions that expresses mode or manner, particularly in terms of necessity, possibility, and other related concepts.

model: In logic and mathematics, a structure that interprets the symbols of a language and satisfies the statements of a theory or system.

model-theoretic consequence: See.

model-theoretic validity: See.

model theory: The branch of mathematical logic that studies the relationship between formal languages and their interpretations or models.

modus ponens: A rule of inference that allows one to derive a conclusion from a conditional statement and its antecedent, formalized as if $P \rightarrow Q$ and $P$, then $Q$.

modus tollens: A rule of inference that allows one to derive a conclusion from a conditional statement and the negation of its consequent, formalized as if $P \rightarrow Q$ and $\neg Q$, then $\neg P$.

molecule: In logic and philosophy, often used metaphorically to refer to a compound entity or concept that is made up of simpler, atomic parts.

monadic first-order logic: A variant of first-order logic restricted to predicates that take only one argument, focusing on properties of individual objects rather than relations between them.

monadic function: See.

monadic predicate: A predicate that takes a single argument, used to express properties of objects or entities within a domain of discourse.

monadic predicate logic: First-order logic with predicates that only take one argument, allowing for the expression of properties of individuals.

monadic relation: See.

monism: See.

monomorphism: A morphism in category theory that is left-cancellable, meaning if two compositions with it are equal, then the other morphisms must be equal, akin to an injective function in set theory.

monotonic logic: A type of logic in which adding new premises to a set does not decrease the set of conclusions that can be derived, ensuring that conclusions are preserved under the addition of new information.

monotonicity: The property of a function or process that preserves order, in logic, referring to systems where conclusions derived from a set of premises are not invalidated by adding more premises.

mood: See.

multi-modal logic: A system of modal logic that incorporates more than one kind of modality, such as necessity, possibility, knowledge, and belief.

multivalent logic: Another term for many-valued logic, emphasizing the presence of more than two truth values beyond the classical true and false.

mutually exclusive: Referring to events or propositions that cannot both occur or be true at the same time, indicating a logical or statistical relationship of exclusion.

N
nand: A logical operation meaning "not and"; it produces a true result for all input combinations except the case where all inputs are true. It is a fundamental operation since any logical function can be constructed using only NAND operations.

n-ary function: A function that takes n arguments, where n is a natural number, generalizing the concept of binary functions to functions of any arity.

n-ary relation: A relation that involves n elements, where n is a natural number, extending the concept of binary relations to relations between more than two entities.

natural deduction: A system of logical inference that attempts to mirror the intuitive ways humans reason, consisting of a set of inference rules for introducing and eliminating logical connectives.

natural language: A language that has developed naturally in human societies as a means of communication, as opposed to artificial or constructed languages.

natural numbers: The set of positive integers, often denoted by $ \mathbb{N} $, and typically including zero. Used as the basis for counting and ordering.

necessary condition: A condition that must be satisfied for a statement to be true but is not sufficient on its own to guarantee the statement's truth.

necessitation rule: In modal logic, a rule stating that if a proposition is a theorem, then its necessity is also a theorem.

necessity: A modal quality indicating that a proposition is true in all possible worlds or under all possible circumstances.

necessity of identity: The principle stating that if two objects are identical, they are necessarily identical in all possible worlds.

negation: A logical operation that inverts the truth value of a proposition; it turns a true statement into a false one and vice versa.

negation completeness: The property of a logical system where every statement or its negation is provable within the system.

negation consistency: The consistency of a logical system in which no statement is both provable and disprovable, including its negation.

negation elimination: A rule in natural deduction that allows the derivation of a conclusion by eliminating a negation, under certain conditions.

negation introduction: A rule in natural deduction that allows for the introduction of negation into a proof, typically by deriving a contradiction from the assumption that the negation is false.

negation normal form: A way of expressing logical formulas where negation is only applied directly to atomic propositions, and the only other allowed connectives are conjunction and disjunction.

negative proposition: A proposition that asserts the non-existence or absence of something, or denies some property of an object.

neo-Fregeanism: A philosophical stance revisiting Frege's logicism with the aim of grounding mathematics, particularly arithmetic and analysis, in logic through the use of Hume's Principle and other axioms.

neo-logicism: A movement in the philosophy of mathematics seeking to revive logicism, the project of founding mathematics on logic, through new insights and approaches, particularly in the wake of criticisms of traditional logicism.

New Foundations: A system of set theory proposed by W.V. Quine with a distinctive axiom schema intended to avoid the paradoxes of naïve set theory while allowing a universal set.

nominalism: The philosophical view that abstract concepts, general terms, or universals have no independent existence but exist only as names or labels for groups of individual objects.

non-alethic modal logic: A form of modal logic that deals with modes of truth beyond the alethic modes of necessity and possibility, such as deontic (duty and permission) or epistemic (knowledge and belief) modalities.

non-classical logic: Any logical system that diverges from the principles of classical logic, including intuitionistic logic, many-valued logics, modal logics, and others that challenge classical assumptions or introduce new principles.

non-commutative logic: A logical system in which the order of application of operations affects the outcome, contrasting with classical logic where operations like conjunction and disjunction are commutative.

non-deterministic polynomial time: The complexity class NP, consisting of decision problems for which a 'yes' answer can be verified by a deterministic Turing machine in polynomial time, given the correct certificate or witness.

non-deterministic turing machine: A theoretical model of computation that, at each step, can make a 'choice' from multiple possibilities, allowing it to explore many possible branches of execution simultaneously.

non-standard logic: Logics that diverge from or extend classical logic, including non-classical logics, many-valued logics, and modal logics, among others. Also called.

non-standard model: A model of a theory that satisfies the axioms of the theory but has properties not intended by the original formulation, often revealing the theory's consistency or independence results.

normal form: In logic, a standardized way of expressing logical formulas, such as conjunctive normal form (CNF) or disjunctive normal form (DNF), to facilitate analysis or computation.

normal modal logic: A class of modal logics that include the necessitation rule and the distribution axiom, allowing for the derivation of necessary truths from given axioms and rules of inference.

NP: A complexity class (nondeterministic polynomial time) that includes decision problems for which a 'yes' answer can be verified in polynomial time by a deterministic Turing machine.

NP-complete: A class of decision problems in NP for which any problem in NP can be reduced to it in polynomial time, and whose solution can be verified in polynomial time; considered among the hardest problems in NP.

numerical quantifier: A quantifier that specifies the exact number of instances for which a predicate holds within a domain of discourse, such as 'exactly three', 'at least five'.

O
object language: The language that is being studied, analyzed, or used to construct statements in a logical system, as opposed to the metalanguage used to talk about the object language.

objectual quantifier: A type of quantifier in formal logic that quantifies over objects in the domain of discourse, as opposed to substituting variables with constants or other expressions.

obverse: In traditional logic, the process of negating the predicate of a categorical proposition and changing its quality (affirmative to negative, or vice versa) without altering its truth value.

obversion: The operation of forming the obverse of a categorical proposition, resulting in an equivalent statement with a negated predicate and opposite quality.

one-to-one: A function or mapping from one set to another where each element of the first set is associated with a unique element of the second set; also known as injective.

ontic vagueness: Vagueness inherent in the nature of reality itself, as opposed to or which relate to language or knowledge, respectively. See also.

onto: A function or mapping from one set to another where every element of the second set is associated with at least one element of the first set; also known as surjective.

open formula: A formula in a formal language that contains free variables, meaning it cannot be determined as true or false until the variables are bound or specified.

open pair: A paradox about a pair of statements that deny each other.

open term: An expression in a formal language that contains free variables, which does not denote a specific object or truth value until the variables are instantiated.

o-proposition: In traditional logic, a particular negative categorical proposition, stating that some members of the subject class are not members of the predicate class.

or: A logical connective (disjunction) that links propositions in a way that the compound proposition is true if at least one of the linked propositions is true.

ordered logic: A logic without and.

ordered n-tuple: A sequence of elements in which the order of the elements matters, generalizing the concept of an ordered pair to sequences of any length.

ordered pair: A fundamental structure in mathematics and logic that consists of two elements arranged in a specific order, typically represented as (a, b).

ostensive definition: A definition that explains the meaning of a term or symbol by pointing to examples and counterexamples of the concept it represents.

P
pairing function: A function that uniquely associates pairs of numbers with a single number, allowing pairs to be encoded as single values.

paraconsistent logic: A non-classical logic that allows for contradictions to exist without deriving absurdity, useful in modeling inconsistent but non-trivial systems.

paradox: A statement or situation that contradicts itself or defies intuition, often challenging existing understandings of logic and truth.

paradoxes of material implication: Paradoxes that arise from the counterintuitive consequences of the material conditional, especially when the antecedent is false or when there is no causal or necessary connection between the antecedent and consequent.

parameter: A parameter is an expression whose referent is assumed to be fixed relative to a particular situation, but whose value can vary across situations.

partial logic: A logical system that allows for statements that are neither true nor false, accommodating undefined terms or indeterminate truth values.

particular proposition: In traditional logic, a proposition that asserts something about some members of a class, as opposed to all members.

Peano arithmetic: A formal system for arithmetic based on axioms proposed by Giuseppe Peano, foundational for the theory of natural numbers.

Peirce's law: A principle in logic (($P \rightarrow Q) \rightarrow P) \rightarrow P$ that is valid in classical but not in intuitionistic logic, named after Charles Sanders Peirce.

permutation: The structural rule that allows one to exchange two formulas that are on the same side of the arrow.

permutation invariant: A property of a function or relation that remains unchanged when the elements of its arguments are permuted.

persuasive definition: A definition intended to influence attitudes or stir emotions by embedding an evaluative component, often used in ethical or political arguments.

petitio principii: Also known as begging the question, an informal fallacy where the conclusion of an argument is assumed in one of the premises.

Philonian conditional: Another term for the material conditional, emphasizing its use in propositional logic to represent "if...then..." statements without implying a causal relation.

philosophical logic: The study of the more abstract or theoretical aspects of logic, often concerning questions about reference, modality, quantification, and the structure of propositions and arguments.

philosophy of logic: A branch of philosophy that examines the nature and scope of logic, including the assumptions, methodologies, and implications of various logical systems.

platonism: In the philosophy of mathematics, the view that abstract mathematical objects exist independently of human thought.

Plato's beard: A metaphorical expression attributed to Willard Van Orman Quine, referring to the problem of non-existent entities and their properties.

plural quantification: Quantification over multiple objects or entities considered together, extending beyond singular quantification to express statements about sets or groups.

pluralism: See.

Polish notation: A prefix notation for logic and arithmetic where operators precede their operands, eliminating the need for parentheses to indicate order of operation.

polyadic first-order logic: First-order logic extended to include predicates with more than one argument, allowing for the expression of relations between multiple objects.

possibility: A modality indicating that a proposition may be true, even if it is not actually true; the capacity for some state of affairs to occur.

possible world: A hypothetical total way things might have been or could be, used in modal logic to analyze possibility, necessity, and other modal concepts.

Post consistency: A theory is "Post consistent" (or absolutely consistent) if and only if there is at least one statement in the language of the theory that is not a theorem; otherwise, it is "Post inconsistent".

post hoc, ergo propter hoc: A logical fallacy that assumes that if one event occurs after another, then the first event must be the cause of the second.

pragmatics: The study of how context influences the interpretation of meaning in language, beyond the literal meaning of words or the structure of sentences.

predicate: A function or relation that asserts a property about or a relationship between individuals or objects in a domain of discourse.

predicate functor: In logic, a symbol that represents a function from individuals or tuples of individuals to truth values, essentially a generalization of a predicate.

predicate functor logic: A logical system that combines elements of predicate logic with the concept of functors, allowing for a more expressive representation of properties and relations.

predicate term: The second term of a proposition in a syllogism.

prefix notation: A way of writing mathematical and logical expressions where the operator precedes its operands, facilitating unambiguous interpretation without parentheses.

prelinearity axiom: The formula (P → Q) ∨ (Q → P).

premise: A statement in an argument that provides support or evidence for the conclusion.

prenex normal form: A form of logical expression where all quantifiers are moved to the front, standardizing the structure of first-order logical statements.

primitive recursion: A form of recursion where a function is defined in terms of itself, using simpler cases, with a base case to stop the recursion.

primitive recursive function: A function computable by a primitive recursive algorithm, representing a class of functions that can be defined by initial functions and operations of composition and primitive recursion.

primitive recursive relation: A relation that can be defined by primitive recursive functions, characterizing a subset of computable relations.

principal connective: See.

probability calculus: The branch of mathematics dealing with probability, including the laws and formulas that govern random variables and events.

probability logic: A logical system that incorporates probabilistic elements to deal with uncertainty, extending classical logic to handle degrees of belief or likelihood.

probability theory: The mathematical study of randomness and uncertainty, focusing on the analysis of random variables, events, and processes.

proof: A logical or mathematical argument that demonstrates the truth of a statement or theorem, based on axioms, definitions, and previously established theorems.

proof by cases: A proof technique that divides the proof into several cases, showing that the statement to be proved holds in each case.

proof by induction: A method of mathematical proof used to establish the truth of an infinite number of cases, based on a base case and an inductive step.

proof theory: The branch of mathematical logic that studies the structure and properties of mathematical proofs, aiming to understand and formalize the process of mathematical reasoning.

proof-theoretic consequence: See.

proof-theoretic semantics: An alternative to truth-condition semantics (also known as model-theoretic semantics), focusing on proof rather than on truth.

proof-theoretic validity: Referring to a valid proof in.

property: See.

proposition: A declarative statement that is capable of being true or false, serving as the basic unit of meaning in logic and philosophy.

propositional attitude: A mental state expressed by verbs such as believe, desire, hope, and know, followed by a proposition, reflecting an individual's attitude towards the truth of the proposition.

propositional connective: See.

propositional function: An expression that becomes a proposition when values are assigned to its variables, essentially a predicate that can take one or more arguments.

propositional letter: A variable in propositional logic that represents a specific, undefined proposition, used as a placeholder in logical formulas.

propositional logic: The branch of logic that deals with propositions as units and uses propositional connectives to construct complex statements, focusing on the truth-values of propositions.

prosentential: Pertaining to the theory that some expressions function as whole propositions rather than referring to objects or describing properties.

prosentential theory of truth: A theory that regards truth as a prosentential operator, simplifying the analysis of truth statements without invoking propositions as entities.

provability logic: A branch of modal logic concerned with the properties of provability and modalities that express notions of necessity as provability within a formal system.

provability predicate: A predicate, often called "Bew", that expresses the concept of a statement being provable within a given formal system.

pseudo modus ponens: Synonym for, the axiom that (A ∧ (A → B)) → B.

punctuation: In logic, refers to parentheses and brackets.

pure first-order logic: The system of first-order logic that contains no function symbols or identity, only predicate symbols.

pure predicate logic: See.

Putnam's model-theoretic argument: An argument by Hilary Putnam challenging the conventional understanding of reference and truth, suggesting that semantic externalism leads to radical skepticism about the meanings of terms and the contents of thoughts.

Q
quality: Refers to whether a categorical proposition is affirmative or negative.

quantified modal logic: An extension of modal logic that includes quantifiers such as "all" and "some", allowing for expressions involving necessity or possibility applied to individuals or properties quantitatively.

quantifier: A logical operator that specifies the quantity of specimens in the domain of discourse that satisfy an open formula, such as "all", "some", or "exists".

quantifier shift fallacy: A logical fallacy involving the incorrect interchange of the position of a quantifier with a modal operator, leading to invalid conclusions.

quantity: Refers to a categorical proposition's being universal or particular.

quantum logic: A non-classical logic that attempts to capture the peculiarities of quantum mechanics, challenging traditional logical principles such as the law of excluded middle and distributivity.

Quine's dictum: The principle that "To be is to be the value of a variable", emphasizing ontological commitment in terms of quantification and the variables of quantified theory.

quod erat demonstrandum (QED): A Latin phrase meaning "which was to be demonstrated", traditionally used at the end of a mathematical proof or logical argument to signify its completion.

quotation: The practice of repeating words or text from another source, often indicated in writing by quotation marks. In logic, it involves referring to the expression itself rather than its meaning.

R
ramified theory of types: An extension of the simple theory of types that includes a hierarchy of levels, allowing for the distinction between objects and functions at different orders to avoid paradoxes such as Russell's paradox.

ramsey sentence: A way of expressing the empirical content of a theory by replacing its theoretical terms with existential quantifiers, named after Frank P. Ramsey.

Ramsey test: A criterion for evaluating the acceptability of conditional statements in terms of belief revision: if adding the antecedent to one's stock of beliefs requires adding the consequent for consistency, then the conditional is accepted.

range: The set of all possible outputs or values that a function can produce, given all possible inputs.

recursion: The process of defining something in terms of itself, often used in mathematics and computer science to define functions, sequences, and structures.

recursion theorem: Master theorem (analysis of algorithms) Kleene's recursion theorem

recursive definition: A definition of a function, set, or other mathematical object that is defined in terms of itself, using a base case and a rule for generating subsequent elements.

recursive function: A function that can be computed by a procedure that calls itself, directly or indirectly, with a base case to prevent infinite recursion.

recursive function theory: The study of recursive functions and their properties, including their computability and classification into hierarchies of complexity.

recursive relation: A relation defined on a set where the relation is specified in terms of itself, allowing for the construction of complex relational structures from simpler ones.

recursively axiomatizable theory: A theory for which there exists a recursive set of axioms that can generate all theorems of the theory through logical deduction.

red herring: An informal fallacy or rhetorical strategy that diverts attention from the original issue or argument by introducing an irrelevant topic.

reductio ad absurdum: A method of argument that demonstrates the falsity of a statement by showing that it logically leads to a contradiction or absurd conclusion.

redundancy theory of truth: A theory of truth that suggests stating that a proposition is true is redundant and does not add anything to the proposition's content.

reference: The relation between words, phrases, or symbols and the objects, concepts, or events they denote or stand for.

referential opacity: A property of expressions wherein substituting a co-referential term does not necessarily preserve truth, typically occurring in intensional contexts like belief reports.

reflexivity: The property of a relation where every element is related to itself, such as the equality relation.

refutation: The process of disproving or showing the falseness of a statement, argument, or theory.

register computable: Computable by a register machine.

register machine: A theoretical model of computation that uses a set of registers to store numbers and a program of instructions to perform calculations, serving as an alternative to the Turing machine model.

relational semantics: An approach to interpreting logical languages where the meaning of sentences is defined in terms of relations between possible worlds or states of affairs, commonly used in modal and temporal logics.

relative consistency proof: A proof showing that if a mathematical system $S$ is consistent, then an extension of $S$ by adding new axioms is also consistent, used to compare the foundational strength of different theories.

relevance logic: A non-classical logic that seeks to capture the notion that the premises of a valid argument must be relevant to the conclusion, avoiding paradoxes of material implication.

representation: A n+1-ary predicate P represents an n-ary function f if, and only if, it is the case that: $Px_1, x_2, \ldots x_n, y$ is true if, and only if, $f(x_1, x_2, \ldots, x_n) = y$. Similarly, a unary predicate P represents a set S if, and only if, it is the case that: Px is true if, and only if, x is a member of S.

reverse mathematics: A program in mathematical logic that seeks to determine which axioms are necessary to prove theorems of mathematics by proving theorems from the weakest possible systems.

revision theory of truth: A theory proposing a non-classical approach to the concept of truth, suggesting that truth values of propositions can be revised in light of paradoxes, notably the liar paradox.

rigid designator: A term that refers to the same object in all possible worlds where that object exists, used in discussions of necessity and identity across possible worlds.

Robinson arithmetic: A fragment of Peano arithmetic that omits the axiom schema of induction, serving as a foundation for arithmetic that is weaker but still expressive.

Ross paradox: A paradox in deontic logic arising from imperatives that imply counterintuitive obligations, demonstrating challenges in formalizing moral and ethical reasoning.

rule of inference: A logical rule that justifies the transition from a set of premises to a conclusion, forming the basis of deductive reasoning.

rule of replacement: A rule in formal logic allowing for the substitution of equivalent expressions within logical proofs, maintaining the validity of the argument.

S
salve veritate: A Latin phrase meaning "with truth unchanged", used in logic and philosophy to indicate a transformation or substitution that preserves the truth value of statements.

satisfaction: In model theory, the relation between a structure and a sentence where the structure makes the sentence true, according to the interpretation of the sentence's symbols in that structure.

satisfiability: The property of a logical formula if there exists at least one interpretation under which the formula is true.

schema: A template or pattern representing a class of similar statements or propositions, often used in the formulation of logical axioms and rules.

scope: The part of a logical formula to which an operator, quantifier, or modifier applies, determining the extent of its operation.

Scott: Dana Scott

sea battle: See.

second-order logic: A logic that extends first-order logic by allowing quantification over predicates and relations, in addition to quantification over individuals.

self-contradictory: A property of a statement or proposition that contradicts itself, making it impossible to be true.

self-reference: The act of referring to oneself or itself, used in discussions of paradoxes, reflexivity, and the foundations of mathematics and logic.

semantic conception of truth: A theory of truth based on the correspondence between statements and facts or states of affairs in the world, emphasizing the role of meaning and interpretation.

semantic consequence: The relation that holds between a set of premises and a conclusion formulated within a certain formal language, such that, for this language, there is no possible interpretation that evaluates the premises as true and the conclusion as false.

semantic paradox: A paradox that arises due to some peculiarity of semantic concepts, such as truth, falsity, and definability, as distinguished from logical or set-theoretical concepts. The distinction between semantical and logical paradoxes is controversial and was invented by Ramsey.

semantic tableau: A method of proof in logic that uses a tree structure to systematically explore the truth or falsity of logical expressions by breaking them down into simpler components.

semantic vagueness: The view that vagueness is a feature of language, rather than of the world or of human knowledge. Contrast and.

semantic value: The meaning or content assigned to a linguistic expression in semantics, including truth values for sentences in logical languages.

semantic validity: A formula is called semantically valid, or a, if it is true under every interpretation.

semantically closed language: A language that contains its own truth predicate, allowing statements about the truth of sentences formulated within the same language.

semantics: The study of meaning in language, including the interpretation of words, phrases, sentences, and texts, and the study of the principles that govern the assignment of meanings.

semi-decidable theory: A theory for which there exists an algorithm that can enumerate all its theorems, but there may not be an algorithm to decide non-theorems.

sense: The aspect of meaning that pertains to the inherent content or connotation of an expression, distinct from its reference or denotation.

sentence letter: A symbol used in propositional logic to represent an arbitrary proposition, serving as a placeholder in logical formulas.

sentential logic: Another term for propositional logic, focusing on the logical relationships between whole sentences or propositions rather than their internal structure.

sequence: An ordered list of objects or terms, each of which is identified by its position in the list, used in mathematics and logic to define functions, sets, and series.

sequent: In sequent calculus, a formal representation of a logical deduction, consisting of a sequence of formulas that precede a turnstile and a sequence of formulas that follow it, indicating premises and conclusion.

sequent calculus: A formal system for deriving logical entailments, representing deductions as sequences of formulas, and emphasizing the structural rules of logical derivation.

seriality: The property of a relation where for every element in the domain, there exists an element in the codomain that is related to another element in a specific way, particularly in the context of binary relations and modal logic.

S4: A modal logic system characterized by the axioms that necessitate reflexivity and transitivity for the accessibility relation, implying that if something is necessary, then it is necessarily necessary.

sharpening: The process of making a vague or imprecise concept more precise or clearly defined, often discussed in the context of semantic vagueness.

Sheffer stroke: A logical operation equivalent to the nand (not and) function; it is functionally complete, meaning all other logical operations can be constructed from it.

signature: In logic and algebra, a set of symbols along with their arities, defining the kinds of operations, functions, and relations considered in a structure or theory.

simple type theory: A type theory that divides objects into a simple hierarchy of objects, classes of objects, classes of classes of objects, etc. The adjective "simple" is used to contrast it with ramified type theory, which further stratifies these simple types into orders.

single turnstile: A symbol used in logic ($\vdash$) to denote syntactic entailment, indicating that a formula or set of formulas derives or proves another formula within a formal system.

singular proposition: A proposition that makes a statement about a specific individual or unique object, as opposed to general statements about classes or categories.

singular term: A term in logic that refers to a single object or entity, distinguishing it from general terms that may refer to classes of objects or properties.

situation: In logic and philosophy, a set of circumstances or a state of affairs to which truth-values of statements are relative, often used in.

situation semantics: An approach to semantics that analyzes meaning in terms of situations, rather than attempting to account for meaning solely in terms of truth conditions at possible worlds.

skolemization: A technique in first-order logic for eliminating existential quantifiers by introducing Skolem functions, used in the process of converting formulas to a standard form.

Skolem-Lowenheim theorem: A theorem stating that if a first-order theory has an infinite model, then it has models of every infinite cardinality, highlighting the flexibility of first-order semantics.

Skolem normal form: A way of expressing first-order logic formulas where all existential quantifiers are moved inside and replaced by Skolem functions, leaving only universal quantifiers at the front.

Skolem paradox: The apparent paradox arising from the Skolem-Lowenheim theorem, where countable models can be found for theories that intuitively require uncountably many objects, challenging notions of absolute size in set theory.

slingshot argument: An argument aiming to show that all true statements refer to the same "fact" or "entity", raising questions about the correspondence theory of truth and the nature of facts.

slippery slope: An informal fallacy or rhetorical argument suggesting that a relatively small first step or minor decision will lead to a chain of related events culminating in a significant (often negative) outcome, without sufficient justification for such inevitability.

s-m-n theorem: A fundamental theorem in the theory of computable functions that provides a method for constructing a specific computable function from a given computable function, highlighting the universality and flexibility of computable functions.

sophism: An argument or form of reasoning deemed fallacious, misleading, or deceptive, historically associated with the Sophists in ancient Greece, who were known for their rhetorical skill and relativistic views on truth and morality.

sophisma: A puzzle or paradoxical question that challenges conventional wisdom or logical reasoning, often used in medieval logic to teach students about logical fallacies and the complexities of language.

sorites paradox: A paradox arising from vague predicates and the problem of heap, illustrating how a series of seemingly acceptable premises can lead to a paradoxical or absurd conclusion.

sorites series: A sequence of propositions associated with the sorites paradox, each adding a small amount to the previous one, challenging the boundary between truth and falsehood for vague concepts.

sound deductive argument: An argument where the logical structure ensures the truth of the conclusion if the premises are true, and where the premises are indeed true, making the argument both valid and sound.

soundness: The property of a logical system wherein every theorem that can be derived using the system's rules is true in every interpretation of the system.

square of opposition: A diagram representing the logical relationships between the four types of categorical propositions (A, E, I, O) in traditional logic, showing their contradictions, contraries, subcontraries, and subalternations.

statement: An assertion that something is or is not the case, capable of being true or false; the basic unit of discourse in logic.

stipulative definition: A definition that assigns a meaning to a word for the first time, or proposes a new meaning for an existing word, without claiming to capture an already established usage.

straw man: An informal fallacy in which an opponent's argument is overstated or misrepresented in order to be more easily attacked or refuted.

strict conditional: A conditional statement interpreted in terms of necessity, such that the truth of the antecedent necessarily implies the truth of the consequent, unlike the material conditional.

strict implication: A relation between propositions where the truth of the first (the antecedent) necessarily brings about the truth of the second (the consequent), often associated with modal logic.

strong completeness: The property of a logical system where if a formula is semantically valid (true in all interpretations), then it is syntactically derivable within the system.

strong counterexample: Within intuitionistic logic and intuitionistic mathematics, a strong counterexample is a proof of the negation of an instance of some variant of the law of excluded middle.

strong inductive argument: An argument that, if the premises are true, provides strong support for the conclusion, making it highly probable but not necessarily true.

strong Kleene connectives: Connectives in three-valued logic proposed by Stephen Cole Kleene, designed to deal with indeterminate or undefined values in a logical system.

strong mathematical induction: A form of mathematical induction that allows one to assume the proposition for all smaller instances simultaneously when proving it for any given instance.

strong negation:

strong paraconsistency: Strong paraconsistency is the view that there are possible worlds where contradictions are true, or where some statements are both true and false. Compare, the view that true contradictions, and worlds that contain them, are merely a formal tool used to study reasoning.

strongly connected: A relation R is strongly connected (or total) if and only if, for all x and y, either Rxy, or Ryx.

structural rule: In logic, especially in proof theory, a rule that concerns the manipulation of the components of sequents or deductions without reference to their internal logical structure, such as contraction, weakening, and exchange.

subaltern: In traditional syllogistic logic, a term describing the relationship between two categorical propositions where the truth of the first (the universal) implies the truth of the second (the particular), but not vice versa.

subalternation: The logical relationship between a universal statement and its corresponding particular statement, where the truth of the universal necessitates the truth of the particular.

subcontraries: In traditional logic, a pair of particular statements (I and O propositions) that cannot both be false together, though both can be true under the square of opposition.

subcontrary: Referring to the relationship between two statements that can both be true but cannot both be false at the same time.

subformula: A part of a formula in logic that is itself a formula, often considered in the context of the formula's syntactic structure.

subject term: The term in a categorical proposition that denotes the subject about which something is asserted.

subjunctive conditional: A conditional statement expressing what would be the case if its antecedent were true, used to explore hypothetical situations and their consequences.

sublanguage: A subset of a language that uses a restricted vocabulary or simpler grammatical structures, often for a specific purpose or domain.

sublogic: A logical system that is a subset of a more comprehensive logic, retaining some but not all of the operations and principles of the larger system.

subordinate connective: A logical connective that occurs within the of another logical connective.

substitution: The act of replacing a variable or expression within a logical formula with another, maintaining logical consistency.

substitution-instance: The well-formed formula which results from a given well-formed formula by replacing one or more of the variables occurring in the well-formed formula throughout by some other well-formed formulas, it being understood that each variable so replaced is replaced by the same well-formed formula wherever it occurs.

substitutional quantifier: A type of quantifier interpreted as ranging over expressions or names rather than over objects directly, used in certain theories of reference and meaning.

substructural logic: A class of non-classical logics that relax or modify structural rules found in classical logic, such as relevance logic and linear logic.

subtheory: A theory contained within a larger theory, sharing some but not all of its axioms and theorems, and focusing on a subset of its domain.

successor function: A fundamental function in arithmetic and logic that maps any natural number to the next larger natural number, denoted as $S(n) = n+1$.

suffix notation: A way of writing expressions where operators follow their operands, also known as reverse Polish notation, used in some calculators and programming languages for its efficiency.

supertask: A task that consists of an infinite sequence of operations completed in a finite amount of time, often discussed in the context of philosophical paradoxes and theoretical physics.

supertrue: A term used in certain theories of truth, such as, to describe propositions that remain true across all precisifications or interpretations of vague terms.

supervaluational semantics: A semantic theory designed to handle vagueness by considering multiple precisifications of vague terms, with a proposition deemed supertrue if it is true under all precisifications.

supposition: In medieval logic, a relation between an expression and the object or concept that the expression is being used to talk about, where the supposition of the expression need not be its literal reference.

suppressed evidence: An informal fallacy that occurs when relevant information is omitted from an argument, potentially leading to a misleading or unjustified conclusion.

surjection: A function from one set to another where every element of the target set is mapped to by at least one element of the domain set, also known as an onto function.

syllogism: A form of deductive reasoning consisting of a major premise, a minor premise, and a conclusion, traditionally used in Aristotelian logic to infer relationships between categories.

syllogistic figure: The form of a syllogism, determined by the position of the middle term in its premises, categorized into four figures that structure the syllogistic argument differently.

syllogistic mood: The type of a syllogism, defined by the nature of its premises (universal affirmative, universal negative, particular affirmative, particular negative) and how they combine to form a conclusion.

syllogistic terms: The three terms in a syllogism: the (predicate of the conclusion), the (subject of the conclusion), and the  (appears in both premises but not in the conclusion). See also.

symmetry: A property of binary relations where if one element is related to another, then the second is related to the first, such as the relation of equality.

syncategorematic terms: Terms that do not stand for objects or have a reference by themselves but contribute to the meaning of expressions in which they occur, such as conjunctions, prepositions, and quantifiers.

syntactic consequence: The relation that holds between premises and the conclusions derivable from them based on axioms and inference rules within a formal system. Contrast.

syntax: The set of rules, principles, and processes that govern the structure of sentences in a given language, distinguishing between correct and incorrect forms of expression.

T
Tarskian hierarchy: A hierarchical structure of languages proposed by Alfred Tarski to avoid paradoxes in semantic theories, where each level of language can only reference levels below it, preventing self-reference.

Tarski's indefinability theorem: A theorem stating that truth cannot be consistently defined within the same language it applies to, requiring a meta-language for a definition of truth to avoid paradoxes.

tautology: A statement or formula that is true in every possible interpretation, often used in propositional logic to refer to formulas that are logically true.

temperature paradox: A paradox where, from "the temperature is ninety" and "the temperature is rising", it is concluded that "ninety is rising", which seems invalid but can actually be valid under some formalization schemes.

temporal modal logic: A branch of modal logic that deals with modalities related to time, such as 'always', 'sometimes', and 'never', allowing for reasoning about temporal aspects of propositions.

term logic: An approach to logic focusing on the relations between terms in propositions and the inferences that can be drawn from them, characteristic of Aristotelian logic.

ternary function: A function that takes three arguments or inputs, in contrast to unary and binary functions.

ternary relation: A relation involving three elements, where the relation specifies how the elements are connected or related.

ternary semantics: A ternary semantics is a possible worlds semantics that makes use of a ternary relation on possible worlds instead of, or in addition to, the more standard binary accessibility relation. Ternary semantics have been most widely applied in the development of relevant logics.

theorem: A statement or proposition that has been formally proven on the basis of previously established statements or axioms within a logical or mathematical system.

theory: A coherent set of propositions or statements, especially one that forms a comprehensive explanation of some aspect of the natural world or an abstract concept.

three-valued logic: A logical system that introduces a third truth value (such as 'unknown', 'indeterminate', or 'both true and false') in addition to the classic binary true and false values.

tilde: The symbol '~' used in logic to denote negation, indicating that the proposition it precedes is false.

token: An instance of a type, such as a particular occurrence of a word or phrase, in contrast to the abstract concept or category it represents.

tolerant: In the theory of vagueness, a predicate is considered tolerant if, and only if, small changes in the relevant underlying properties of an object do not affect the justice with which the predicate applies to it. Thus, the predicate "bald" is tolerant, since one hair more or less does not transform a clear instance of baldness into a clear instance of non-baldness.

tonk: A fictional logical connective introduced to illustrate the importance of preserving inference rules in defining logical operators, showing that arbitrary rules can lead to absurdity.

top: In logic, a symbol (⊤) representing the highest or maximal element in a lattice or order, often used to denote a tautology or universally true proposition in propositional logic.

topos: A concept in category theory generalizing set theory concepts within a more abstract framework, allowing for the definition of mathematical structures in different contexts.

topos theory: The study of toposes, which are categories that behave like the category of sets and provide a foundation for much of mathematics, allowing for generalized notions of computation and logic.

total function: A function that is defined for every element of its domain, ensuring that there is an output for each input.

transition function: See.

transitive closure: The smallest transitive relation that contains a given relation, effectively adding the minimum necessary elements to make the original relation transitive.

transitivity: A property of a relation where if the relation holds between A and B, and between B and C, then it also holds between A and C, ensuring a kind of consistency or continuity in the relation across elements.

translation: A translation is a function from the expressions of one language to the expressions of another language. Translations are typically intended to preserve either the meanings or the truth conditions of the translated expressions.

translation lemma: Synonym for the $S n m$ theorem.

transposition: A logical rule that allows the equivalent transformation of a conditional statement $P \rightarrow Q$ into its contrapositive $\neg Q \rightarrow \neg P$, preserving truth.

trans-world identity: A concept in modal logic and metaphysics concerning the identity of individuals across different possible worlds, addressing questions of persistence and change.

trichotomy: A relation R is trichotomous (or comparable) if and only if, for any objects x and y, either Rxy, or Ryx, or x = y.

trichotomy law: A law in order theory and mathematics stating that for any two elements in a certain set, exactly one of three relationships (greater than, less than, or equal to) must hold.

triviality: The state or quality of being trivial, in logic and mathematics, often referring to statements, propositions, or problems that are oversimplified or of little interest or importance.

truth: A concept in logic and philosophy concerning the property of statements, beliefs, or propositions corresponding to reality or fact, or being in accord with the actual state of affairs.

truth conditions: The conditions under which a statement or proposition is considered to be true, playing a central role in the semantic analysis of language.

truth function: A function that takes truth values as input and produces a truth value as output, used in logic to model the truth conditions of logical connectives.

truth-functional: Pertaining to an operator or connective in logic whose output truth value depends solely on the input truth values, without regard to the content of the propositions involved.

truth-in-a-model: A concept in semantic theories of truth indicating that a statement or proposition is true relative to a particular model or interpretation of the language in which it is expressed.

truthmaker: An entity or set of entities in the world that makes a proposition true, grounding truth in aspects of reality.

truth predicate: A predicate that assigns the property of being true to propositions, often discussed in relation to Tarski's semantic conception of truth and the liar paradox.

truth table: A table used in logic to show the truth value of a compound statement for every possible combination of truth values of its components, instrumental in analyzing logical expressions.

truth-teller: The converse of the liar paradox, a statement that asserts its own truth, raising questions about self-reference and the nature of truth.

truth-tree: Synonym of analytic tableaux.

truth value: The value indicating the truth or falsity of a proposition or statement, typically represented as true or false in classical logic, but possibly more varied in many-valued logics.

truth-value gap: A situation where a statement or proposition cannot be assigned a traditional truth value of true or false, often due to vagueness or undefined terms.

truth-value glut: A condition in which a statement or proposition is paradoxically both true and false simultaneously, associated with dialetheism and contradictions.

T-schema: The Tarski schema for defining truth, stating that 'P' is true if and only if P, where 'P' is a placeholder for a proposition and P is the proposition itself.

tu quoque: A logical fallacy that attempts to discredit an opponent's position by asserting the opponent's failure to act consistently with that position, essentially accusing them of hypocrisy.

Turing computable function: A function that can be calculated by a Turing machine, representing the class of functions that are computable in principle, according to the.

Turing thesis: See.

turnstile: A symbol used in logic ($\vdash$) to denote syntactic entailment or provability, indicating that the statement or set of statements to the right is a logical consequence of the statements to the left within a given formal system.

type: (In type theory.) A category or class of entities that share certain characteristics, used in logic and mathematics to distinguish between different kinds of objects, expressions, or variables, preventing certain kinds of logical paradoxes. (In the type-token distinction.) A universal, as opposed to a particular..

type theory: A framework in mathematical logic and computer science that uses types to classify expressions and objects, aiming to avoid paradoxes like Russell's paradox by organizing objects into hierarchies or levels and restricting operations to objects of the same type.

U
unary function: A function that operates on a single input or argument, common in mathematics and logic for representing operations like negation or the absolute value function.

unary relation: A relation that applies to a single element, used to characterize properties or attributes that an element may or may not possess.

universal elimination: A rule of inference in predicate logic that allows for the derivation of a specific statement about an individual from a general statement that applies to all members of a category.

universal introduction: A rule of inference in predicate logic that allows for the generalization of a statement to all members of a category if the statement is shown to hold for an arbitrary but specific individual.

universal proposition: A statement in logic that asserts something about all members of a certain category, typically formulated using a universal quantifier.

universal quantifier: A symbol in predicate logic ($\forall$) used to indicate that the statement it precedes holds for all individuals in the domain of discourse.

universal variable: A variable in predicate logic that is bound by a universal quantifier, representing any and all individuals in the domain of discourse.

universe of discourse: The set of all objects, individuals, or values that are relevant in a particular logical or mathematical discussion, serving as the domain over which quantifiers range.

upward Löwenheim–Skolem theorem: Part of the.

unsound deductive argument: An argument that is either invalid in its logical form or contains at least one false premise, and therefore does not guarantee the truth of its conclusion.

use: In philosophy, particularly in the analysis of language, "use" refers to the actual application of a word or a phrase in a sentence to convey meaning. In the use-mention distinction, "use" involves employing words to refer to things, actions, qualities, or concepts in the world. For example, in the sentence "I enjoy reading books," the word "books" is used to refer to objects that can be read; it is not merely.

V
vacuous quantifier: A vacuous quantifier is one that doesn't bind any variables, such as the second quantifier in $\forall x \forall y Rxx$.

vagueness: The characteristic of terms, concepts, or propositions that lack clear boundaries or precision in meaning, leading to indeterminate or borderline cases.

valid: A deductive argument whose structure ensures that if all the premises are true, then the conclusion must also be true, demonstrating logical validity. In model-theoretic semantics, a formula that is true under all interpretations. In proof-theoretic semantics, a formula that is either an explicit rule of inference of a system, or that does not allow one to prove anything that could not be proved using the explicit rules of inference.

valuation: Another name for an interpretation of a formal language, coming from the fact that it assigns semantic values (such as truth values) to the language's formulas.

variable assignment: Sometimes, an interpretation of a formal language for first-order or higher-order logic is called simply a "variable assignment", or "variable assignment function".

vel: The Latin word for "or", used in logic as a name for ∨, the descending wedge symbol. The symbol is used to denote a disjunction that is inclusive, meaning at least one of the disjuncts must be true for the whole expression to be true.

verification constraint: See.

verity: The verity (or "degree of truth") of a statement is the semantic value of that statement within degree-theoretic semantics, which assigns degrees between 0 and 1 to statements.

verum: Verum (Latin for "true") is another name for the $\top$ symbol, which represents a primitive, necessarily true statement, and is sometimes considered a nullary connective.

vicious circle principle: A principle against definitions or arguments that are circular, ensuring that the thing being defined is not used in its own definition or premise in a way that presupposes its conclusion.

W
weak completeness: The property of a logical system where if a statement is semantically valid (true under all interpretations), then there is a proof of the statement within the system.

weak counterexample: Within intuitionistic logic and intuitionistic mathematics, a weak counterexample is a situation in which we have no positive evidence for the (intuitionistic) truth of some instance of the law of excluded middle, $p \lor \neg p$.

weak excluded middle: A principle in intuitionistic logic stating that for any proposition P, either P is provable or not-P is provable, but not necessarily both, reflecting a more nuanced view of truth than the classical law of excluded middle.

weak Kleene connectives: Connectives defined in the three-valued logic of Kleene, which do not fully determine the truth value of compound statements if any component statement is undefined.

weak mathematical induction: A form of mathematical induction that only assumes the truth of the statement for the immediately preceding case to prove its truth for any natural number, as opposed to strong induction, which assumes the statement for all smaller numbers.

weak negation: A form of negation in some non-classical logics where the negation of a proposition does not assert the truth of the opposite proposition but rather the absence of truth of the original proposition.

weak paraconsistency: Weak paraconsistency is the view that true contradictions, and worlds that contain them, are merely a formal tool used to study reasoning. Compare, the view that there are possible worlds where contradictions are true, or where some statements are both true and false.

weakening: A rule in both propositional and predicate logic allowing the addition of propositions to a derivation without affecting its validity, reflecting the idea that if something follows from a set of premises, it also follows from any larger set of premises.

wedge: A symbol used in logic ($\wedge$) to represent logical conjunction, indicating that both connected statements are true.

well-formed formula: A string of symbols in a formal language that follows the syntactic rules of the language, making it a meaningful or grammatically correct expression within the context of that system.

wff: Short for. Pronounced "woof", or sometimes "wiff",   "weff",  or "whiff". (All sources supported "woof". The sources cited for "wiff", "weff", and "whiff" gave these pronunciations as alternatives to "woof". Gensler gives "wood" and "woofer" as examples of how to pronounce the vowel in "woof".) Plural "wffs".

Y
Yablo paradox: A paradox involving an infinite sequence of sentences, each of which states that all following sentences in the sequence are false. Unlike the liar paradox, it does not rely on self-reference, raising questions about the nature of paradoxes and infinity.

Z
Zeno paradoxes: A series of paradoxes proposed by the ancient Greek philosopher Zeno of Elea to challenge the coherence of the concepts of plurality, motion, and the continuum, including the famous paradoxes of Achilles and the tortoise, and the dichotomy.