The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the paper we formulate a sufficient criterion in order for the first order theory with finite set of axioms to be represented by definitions in predicate calculus. We prove the corresponding theorem. According to this criterion such theories as the theory of equivalence relation, the theory of partial order and many theories based on the equality relation with finite set of functional and predicate...
We prove two theorems concerning expressive power of relational and functional languages. The theorems have interesting consequences for the history of philosophy and logic.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.