scientific article; zbMATH DE number 3784831
zbMATH Open0498.03001MaRDI QIDQ3962956FDOQ3962956
Authors: Elliott Mendelson 
Publication date: 1979
Title of this publication is not available (Why is that?)
algorithmsnon-standard analysisquantification theoryfirst-order arithmeticultrapowersNBG set theoryelementary extensionseffective computabilityformal number theoryGoedel's completeness theorem
Classical propositional logic (03B05) Classical first-order logic (03B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Computability and recursion theory (03Dxx) Model theory (03Cxx) Set theory (03Exx) Nonstandard models (03Hxx)
Cited In (25)
- Some quantifiers require two-predicate scopes
- A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic
- An alternative construction of Conway's ordered field No
- Mathematical properties common in all mechanism models of chemical reactions
- Errata to ``An alternative construction of Conway's ordered field No.
- Carnapian extensions of S5
- The decision problem for effective procedures
- Control problems in a temporal logic framework
- Algebraic study of Sette's maximal paraconsistent logic
- Ontologically neutral logic
- Internal set theory: A new approach to nonstandard analysis
- Belief revision in the service of scientific discovery
- A logical expression of reasoning
- On the recognition of the tautological nature of propositional formulas
- A comment on the joint embedding property
- On diffeomorphic mappings of one nondegenerate parallelepiped onto another
- A generalised model of judgment aggregation
- A set-theoretic translation method for polymodal logics
- Paraconsistent intelligent systems of computer logics
- Isotypeness of models and knowledge bases equivalence
- Closed world assumptions having precedence in predicates
- A finitely axiomatized formalization of predicate calculus with equality
- AN APPLICATION OF FIRST-ORDER LOGIC TO THE STUDY OF RECOGNIZABLE LANGUAGES
- Herbrand semantics, the potential infinite, and ontology-free logic
- Using forcing to prove completeness of resolution and paramodulation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962956)
