💡 Words with a Similar Meaning to "Presburger arithmetic"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| peano arithmeticnoun | (logic) A set of axioms of first-order logic for the natural numbers specifying the operations of zero, successor, addition and multiplication, including a first-order schema of induction. |
| arithmetical setnoun | (logic) A set of natural numbers that can be defined by a formula of first-order Peano arithmetic. |
| peano axiomnoun | (mathematics) Any of a set of fundamental axioms describing the natural numbers and their relationships. |
| predicate logicnoun | (logic) First-order logic. |
| clarithmetic | — |
| arithmetic hierarchynoun | (logic) Alternative form of arithmetical hierarchy. [(logic) A hierarchy which classifies the complexity of first-order formulae (and sets defined by them) based on the number of alternations between series of unbounded existential quantifiers and universal quantifiers.] |
| zero-order logicnoun | Prepositional logic. |
| polish notationnoun | (arithmetic, logic) A notation for arithmetic (and logical) formulae in which operations (respectively, quantifiers and operands) are written immediately before their operands, used to avoid the need for parentheses; for example, 3 * (4 + 7) is written as * 3 + 4 7 and A AND B is written as AND A B. |
| second-order logicnoun | A formal system which extends first-order logic by allowing quantification over relations between members of the universe. |
| robinson arithmeticnoun | (mathematics) A finitely axiomatized fragment of first-order Peano arithmetic, lacking the axiom schema of mathematical induction. |
| positive logicnoun | (logic) A logical system or fragment thereof not containing a negation operator. |
| boolean algebranoun | (algebra, logic, computing) Specifically, an algebra in which all elements can take only one of two values (typically 0 and 1, or "true" and "false") and are subject to operations based on AND, OR and NOT |
| predicate calculusnoun | (logic) The branch of logic that deals with quantified statements such as "there exists an x such that..." or "for any x, it is the case that...", where x is a member of the domain of discourse. |
| primorial | (number theory) Any number belonging to the integer sequence whose nth element is the product of the first n primes. |
| binary arithmeticnoun | (arithmetic) arithmetic using binary numbers |
| reverse polish notationnoun | (arithmetic) An arithmetic notation in which numbers precede the operators to be applied to them. |
| arithmetical hierarchynoun | (logic) A hierarchy which classifies the complexity of first-order formulae (and sets defined by them) based on the number of alternations between series of unbounded existential quantifiers and universal quantifiers. |
| axiomnoun | (logic, mathematics, proof theory) A fundamental assumption that serves as a basis for deduction of theorems; a postulate (sometimes distinguished from postulates as being universally applicable, whereas postulates are particular to a certain science or context). |
| first-order logicnoun | (logic) A formal deductive system extended from propositional logic with the possibility to quantify over individuals of the domain of discourse. |
| axiom schemanoun | (logic) A formula in the language of an axiomatic system, in which one or more schematic variables appear, which stand for any term or subformula of the system, which may or may not be required to satisfy certain conditions. |
Translate “Presburger arithmetic” into Another Language
Pick a language — the word will be pre-filled in the translator.