display all the ideas for this combination of texts
2 ideas
| 13438 | 'Prenex normal form' is all quantifiers at the beginning, out of the scope of truth-functors [Bostock] |
| Full Idea: A formula is said to be in 'prenex normal form' (PNF) iff all its quantifiers occur in a block at the beginning, so that no quantifier is in the scope of any truth-functor. | |
| From: David Bostock (Intermediate Logic [1997], 3.7) | |
| A reaction: Bostock provides six equivalences which can be applied to manouevre any formula into prenex normal form. He proves that every formula can be arranged in PNF. |
| 13818 | If we allow empty domains, we must allow empty names [Bostock] |
| Full Idea: We can show that if empty domains are permitted, then empty names must be permitted too. | |
| From: David Bostock (Intermediate Logic [1997], 8.4) |