# Math › Logic formulae

Formulas of predicate, mostly FOL, logic that express common mathematical notions. Formulae are given loosely, avoring the succinct loose-math-system to the stricter, FOL system, that relies on predicates excessively. The canonical example of this is `∀x ∈ ℕ` (math-loose) vs `∀x.P(x)` (strict-FOL) with the predicate `P` standing for the property of "being a natural number".


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://mandober.gitbook.io/math-debrief/900-index/enums/enum-logic-formulas.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.