On simplicity of formulas
Given an axiom system S, it is natural to ask if S has an equivalent simpler reformulation. The authors give a precise notion of simplicity using a generalized Kleene-Mostowski classification that takes into account not only the number of quantifier alternations, but also the number of quantifiers. To prove that formulas are written in their simplest form, they develop the appropriate preservation theorems, using Fraïssé's partial isomorphisms. Extensions are given to languages with function symbols, many-sorted languages, and nonelementary logics. It is proved that some well-established axiom systems cannot be simplified.
- An application of games to the completeness problem for formalized theories
- Definability with bounded number of bound variables
- Generalized Ehrenfeucht games
- scientific article; zbMATH DE number 6003856 (Why is no real title available?)
- scientific article; zbMATH DE number 3916232 (Why is no real title available?)
- scientific article; zbMATH DE number 3941493 (Why is no real title available?)
- scientific article; zbMATH DE number 4031646 (Why is no real title available?)
- scientific article; zbMATH DE number 4043822 (Why is no real title available?)
- scientific article; zbMATH DE number 3675868 (Why is no real title available?)
- scientific article; zbMATH DE number 3528202 (Why is no real title available?)
- scientific article; zbMATH DE number 3532912 (Why is no real title available?)
- scientific article; zbMATH DE number 3609629 (Why is no real title available?)
- scientific article; zbMATH DE number 3236046 (Why is no real title available?)
- scientific article; zbMATH DE number 3339390 (Why is no real title available?)
- scientific article; zbMATH DE number 3093421 (Why is no real title available?)
- Logic with the quantifier “there exist uncountably many”
- On a generalization of quantifiers
- On the extending of models (I)
- On the extending of models (IV)
- Recursive Predicates and Quantifiers
- Some applications of a non-Archimedean analogue of Descartes' rule of signs
- Some model theory for monotone quantifiers
- The role of the axiom of induction in elementary arithmetic
- Theory of models with generalized atomic formulas
- Upper and lower bounds for first order expressibility
- Technical notes on a theory of simplicity
- On simplification of formulas with unconstrained variables and quantifiers
- The ubiquitous axiom
- On simplifying truth-functional formulas
- scientific article; zbMATH DE number 3900727 (Why is no real title available?)
- scientific article; zbMATH DE number 4059364 (Why is no real title available?)
- Simplifying Inclusion–Exclusion Formulas
- The parallel postulate
- Simple forms of Aristotle's axiom and of the \textit{Lotschnittaxiom}
This page was built for publication: On simplicity of formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757354)
