Characterizing Second Order Logic with First Order Quantifiers
A language Q is defined and given semantics, the formulae of which are quantifier-free first-order matrices prefixed by combinations of finite partially ordered first-order quantifiers. It is shown that Q is equivalent in expressive power to second order logic by establishing the equivalence of alte...
| Autor principal: | |
|---|---|
| Publicado em: |
2023
|
| Acesso em linha: | https://hdl.handle.net/1721.1/148923 |