On this page you'll find 10+ example sentences with Presburger. Discover the meaning, how to use the word correctly in a sentence.
Presburger in a sentence
Presburger meaning
- A surname.
- Mojżesz Presburger (Polish mathematician)
Using Presburger
- The main meaning on this page is: A surname. | Mojżesz Presburger (Polish mathematician)
- In the example corpus, presburger often appears in combinations such as: presburger arithmetic, in presburger, for presburger.
Context around Presburger
- Average sentence length in these examples: 23.9 words
- Position in the sentence: 8 start, 5 middle, 3 end
- Sentence types: 16 statements, 0 questions, 0 exclamations
Corpus analysis for Presburger
- In this selection, "presburger" usually appears near the start of the sentence. The average example has 23.9 words, and this corpus slice is mostly made up of statements.
- Around the word, proved, characterization, arithmetic, definable and proved stand out and add context to how "presburger" is used.
- Recognizable usage signals include accepts a presburger definable set and applications because presburger arithmetic is. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "presburger" sits close to words such as aaaa, abbv and abductees, which helps place it inside the broader word index.
Example types with presburger
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
Let n be the length of a statement in Presburger arithmetic. (11 words)
Applications Because Presburger arithmetic is decidable, automatic theorem provers for Presburger arithmetic exist. (13 words)
Presburger arithmetic can be extended to include multiplication by constants, since multiplication is repeated addition. (15 words)
Examples include finding a perfect strategy for chess (on an N × N board) citation and some other board games. citation The problem of deciding the truth of a statement in Presburger arithmetic requires even more time. (36 words)
Presburger arithmetic is complete, consistent, and recursively enumerable and can encode addition but not multiplication of natural numbers, showing that for Gödel's theorems one needs the theory to encode not just addition but also multiplication. (36 words)
Fischer and Rabin's work also implies that Presburger arithmetic can be used to define formulas which correctly calculate any algorithm as long as the inputs are less than relatively large bounds. (32 words)
Example sentences (16)
Properties Mojżesz Presburger proved Presburger arithmetic to be: * consistent : There is no statement in Presburger arithmetic which can be deduced from the axioms such that its negation can also be deduced.
Applications Because Presburger arithmetic is decidable, automatic theorem provers for Presburger arithmetic exist.
Presburger-definable integer relation Some properties are now given about integer relations definable in Presburger Arithmetic.
Examples include finding a perfect strategy for chess (on an N × N board) citation and some other board games. citation The problem of deciding the truth of a statement in Presburger arithmetic requires even more time.
Fischer and Rabin's work also implies that Presburger arithmetic can be used to define formulas which correctly calculate any algorithm as long as the inputs are less than relatively large bounds.
For example, the Coq proof assistant system features the tactic omega for Presburger arithmetic and the Isabelle proof assistant contains a verified quantifier elimination procedure by Nipkow (2010).
For example, the decision problem in Presburger arithmetic has been shown not to be in P, yet algorithms have been written that solve the problem in reasonable times in most cases.
Generally, any number concept leading to multiplication cannot be defined in Presburger arithmetic, since that leads to incompleteness and undecidability.
Let n be the length of a statement in Presburger arithmetic.
More recent Satisfiability Modulo Theories solvers use complete integer programming techniques to handle quantifier-free fragment of Presburger arithmetic theory (King, Barrett, Tinelli 2014).
Muchnik's characterization Presburger-definable relations admit another characterization: by Muchnik's theorem. citation It is more complicated to state, but led to the proof of the two former characterizations.
Muchnik's theorem also allows one to prove that it is decidable whether an automatic sequence accepts a Presburger-definable set.
On the other hand, a triply exponential upper bound on a decision procedure for Presburger Arithmetic was proved by Oppen (1978).
Overview The language of Presburger arithmetic contains constants 0 and 1 and a binary function +, interpreted as addition.
Presburger arithmetic can be extended to include multiplication by constants, since multiplication is repeated addition.
Presburger arithmetic is complete, consistent, and recursively enumerable and can encode addition but not multiplication of natural numbers, showing that for Gödel's theorems one needs the theory to encode not just addition but also multiplication.
Common combinations with presburger
These word pairs occur most frequently in English texts:
- presburger arithmetic 16×
- in presburger 6×
- for presburger 3×
- of presburger 2×