Stack Overflow
Stack Overflow

Questions tagged [quantifiers]

In logic, quantification is the binding of a variable ranging over a domain. The variable thereby becomes bound by an operator called a quantifier.

In logic, quantification is the binding of a variable ranging over a domain. The variable thereby becomes bound by an operator called a quantifier.

The two fundamental kinds of quantification in predicate logic are universal quantification and existential quantification.

233 questions
-1
votes
2 answers

clear understanding on possesive quantifiers

i have read so many questions and answers on possessive quantifiers in java in this website and java tutorials but men, am still confused!! am not understanding!! for example lets say my regex is .*+foo my input string is mdfoo according to my…
Edijae Crusar
  • 3,473
  • 3
  • 37
  • 74
-1
votes
1 answer

Why isn't the "X, at MOST n times" regex quantifier included in Java, in the "X{,n}" syntax?

Java docs tell us you can have this greedy quantifiers: X{n} X, exactly n times X{n,} X, at least n times X{n,m} X, at least n but not more than m times There is no mention of having X, at MOST n times. So I made a little test: boolean…
orlandocr
  • 313
  • 2
  • 8
-2
votes
2 answers

How to create a regex that matches either 0 occurrences, or between 7 and 50 occurrences?

In regex, I can match zero or more occurrences with *, and between 7 and 50 occurrences with {7,50}. How can I match either zero or between 7 and 50 occurrences?
gkeenley
  • 6,088
  • 8
  • 54
  • 129
-2
votes
1 answer

Regex Backeference Multiplying

I am trying to learn regex and one of the exercise I am trying to solve is as follows: I have a string: "london new york" that I am trying match with regex. and pattern is like this: r"(..o(.)).+(\2)*" Result is ndon new york. As far…
jdoe
  • 59
  • 10
-2
votes
1 answer

Guarantees about partial model when check-sat returns unknown

I have a question about partial models from z3. I have looked online for information about them, but sadly I have not found much, other than that they can sometimes be retrieved when a verification fails. In case (check-sat) returns unknown, what…
user10369072
  • 1
-2
votes
3 answers

How to express this sentence by using quantifiers and logical operators

Here is the sentence: There is a shortest person, but there is no tallest person.
zodiac
  • 75
  • 7
-2
votes
2 answers

Prove or Disprove quantifiers (propositions logic)

What approach can i take to solve these question: Prove or disprove the following statements. The universe of discourse is N = {1,2,3,4,...}. (a) ∀x∃y,y = x·x (b) ∀y∃x,y = x·x (c) ∃y∀x,y = x·x.
IT ken
  • 5
  • 1
  • 1
  • 10
-2
votes
5 answers

How do I quantify a group in Javascript's regex?

Let's say I had a string "QQxaxbxcQQ", and I wanted to capture all groups of x followed by any character. I also only want to search between the QQ's (the string may include other things in it). I assumed this would have worked: var matches =…
user200814
  • 275
  • 1
  • 3
  • 8
1 2 3
…
15
16