Faster access than browser!
31 relations: Arabic numerals, Axiom schema, Category mistake, Concatenation, Electron, First-order logic, Formal language, Greek alphabet, Iteration, Latin script, Logic, Logical consequence, Logical disjunction, Metalanguage, Natural number, Negation, Number, Numeral system, People, Philosopher, Predicate (mathematical logic), Recursive definition, Sentence (mathematical logic), String (computer science), String interpolation, Template processor, Truth-value semantics, Use–mention distinction, Variable (computer science), Well-formed formula, Willard Van Orman Quine.
Arabic numerals
Arabic numerals, also called Hindu–Arabic numerals, are the ten digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, based on the Hindu–Arabic numeral system, the most common system for the symbolic representation of numbers in the world today.
New!!: Quasi-quotation and Arabic numerals · See more »
Axiom schema
In mathematical logic, an axiom schema (plural: axiom schemata or axiom schemas) generalizes the notion of axiom.
New!!: Quasi-quotation and Axiom schema · See more »
Category mistake
A category mistake, or category error, or categorical mistake, or mistake of category, is a semantic or ontological error in which things belonging to a particular category are presented as if they belong to a different category, or, alternatively, a property is ascribed to a thing that could not possibly have that property.
New!!: Quasi-quotation and Category mistake · See more »
Concatenation
In formal language theory and computer programming, string concatenation is the operation of joining character strings end-to-end.
New!!: Quasi-quotation and Concatenation · See more »
Electron
The electron is a subatomic particle, symbol or, whose electric charge is negative one elementary charge.
New!!: Quasi-quotation and Electron · See more »
First-order logic
First-order logic—also known as first-order predicate calculus and predicate logic—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science.
New!!: Quasi-quotation and First-order logic · See more »
Formal language
In mathematics, computer science, and linguistics, a formal language is a set of strings of symbols together with a set of rules that are specific to it.
New!!: Quasi-quotation and Formal language · See more »
Greek alphabet
The Greek alphabet has been used to write the Greek language since the late 9th or early 8th century BC.
New!!: Quasi-quotation and Greek alphabet · See more »
Iteration
Iteration is the act of repeating a process, to generate a (possibly unbounded) sequence of outcomes, with the aim of approaching a desired goal, target or result.
New!!: Quasi-quotation and Iteration · See more »
Latin script
Latin or Roman script is a set of graphic signs (script) based on the letters of the classical Latin alphabet, which is derived from a form of the Cumaean Greek version of the Greek alphabet, used by the Etruscans.
New!!: Quasi-quotation and Latin script · See more »
Logic
Logic (from the logikḗ), originally meaning "the word" or "what is spoken", but coming to mean "thought" or "reason", is a subject concerned with the most general laws of truth, and is now generally held to consist of the systematic study of the form of valid inference.
New!!: Quasi-quotation and Logic · See more »
Logical consequence
Logical consequence (also entailment) is a fundamental concept in logic, which describes the relationship between statements that hold true when one statement logically follows from one or more statements.
New!!: Quasi-quotation and Logical consequence · See more »
Logical disjunction
In logic and mathematics, or is the truth-functional operator of (inclusive) disjunction, also known as alternation; the or of a set of operands is true if and only if one or more of its operands is true.
New!!: Quasi-quotation and Logical disjunction · See more »
Metalanguage
Broadly, any metalanguage is language or symbols used when language itself is being discussed or examined.
New!!: Quasi-quotation and Metalanguage · See more »
Natural number
In mathematics, the natural numbers are those used for counting (as in "there are six coins on the table") and ordering (as in "this is the third largest city in the country").
New!!: Quasi-quotation and Natural number · See more »
Negation
In logic, negation, also called the logical complement, is an operation that takes a proposition P to another proposition "not P", written \neg P (¬P), which is interpreted intuitively as being true when P is false, and false when P is true.
New!!: Quasi-quotation and Negation · See more »
Number
A number is a mathematical object used to count, measure and also label.
New!!: Quasi-quotation and Number · See more »
Numeral system
A numeral system (or system of numeration) is a writing system for expressing numbers; that is, a mathematical notation for representing numbers of a given set, using digits or other symbols in a consistent manner.
New!!: Quasi-quotation and Numeral system · See more »
People
A people is a plurality of persons considered as a whole, as is the case with an ethnic group or nation.
New!!: Quasi-quotation and People · See more »
Philosopher
A philosopher is someone who practices philosophy, which involves rational inquiry into areas that are outside either theology or science.
New!!: Quasi-quotation and Philosopher · See more »
Predicate (mathematical logic)
In mathematical logic, a predicate is commonly understood to be a Boolean-valued function P: X→, called the predicate on X. However, predicates have many different uses and interpretations in mathematics and logic, and their precise definition, meaning and use will vary from theory to theory.
New!!: Quasi-quotation and Predicate (mathematical logic) · See more »
Recursive definition
A recursive definition (or inductive definition) in mathematical logic and computer science is used to define the elements in a set in terms of other elements in the set (Aczel 1978:740ff).
New!!: Quasi-quotation and Recursive definition · See more »
Sentence (mathematical logic)
In mathematical logic, a sentence of a predicate logic is a boolean-valued well-formed formula with no free variables.
New!!: Quasi-quotation and Sentence (mathematical logic) · See more »
String (computer science)
In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.
New!!: Quasi-quotation and String (computer science) · See more »
String interpolation
In computer programming, string interpolation (or variable interpolation, variable substitution, or variable expansion) is the process of evaluating a string literal containing one or more placeholders, yielding a result in which the placeholders are replaced with their corresponding values.
New!!: Quasi-quotation and String interpolation · See more »
Template processor
A template processor (also known as a template engine or template parser) is software designed to combine templates with a data model to produce result documents.
New!!: Quasi-quotation and Template processor · See more »
Truth-value semantics
In formal semantics, truth-value semantics is an alternative to Tarskian semantics.
New!!: Quasi-quotation and Truth-value semantics · See more »
Use–mention distinction
The use–mention distinction is a foundational concept of analytic philosophy, according to which it is necessary to make a distinction between using a word (or phrase) and mentioning it,Devitt and Sterelny (1999) pp.
New!!: Quasi-quotation and Use–mention distinction · See more »
Variable (computer science)
In computer programming, a variable or scalar is a storage location (identified by a memory address) paired with an associated symbolic name (an identifier), which contains some known or unknown quantity of information referred to as a value.
New!!: Quasi-quotation and Variable (computer science) · See more »
Well-formed formula
In mathematical logic, propositional logic and predicate logic, a well-formed formula, abbreviated WFF or wff, often simply formula, is a finite sequence of symbols from a given alphabet that is part of a formal language.
New!!: Quasi-quotation and Well-formed formula · See more »
Willard Van Orman Quine
Willard Van Orman Quine (known to intimates as "Van"; June 25, 1908 – December 25, 2000) was an American philosopher and logician in the analytic tradition, recognized as "one of the most influential philosophers of the twentieth century." From 1930 until his death 70 years later, Quine was continually affiliated with Harvard University in one way or another, first as a student, then as a professor of philosophy and a teacher of logic and set theory, and finally as a professor emeritus who published or revised several books in retirement.
New!!: Quasi-quotation and Willard Van Orman Quine · See more »
Redirects here:
Quasi-quote, Quasiquotation, Quasiquote, Quine quotation mark, Quine quotation marks, Quine quote, Quine quotes.
References
[1] https://en.wikipedia.org/wiki/Quasi-quotation
