An elementary system as and its semi‐completeness and decidability

Mathematical Logic Quarterly 38 (1):305-320 (1992)
  Copy   BIBTEX

Abstract

The author establishes an elementary system AS which contains functions +, ≐ and a constant 0 and then proves the semi-completeness and the decidability of AS, using the theory of systems of inequalities

Categories

Keywords

Reprint years

DOI

10.1002/malq.19920380128

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation.Mojżesz Presburger & Dale Jabcquette - 1991 - History and Philosophy of Logic 12 (2):225-233.
Probabilization of Logics: Completeness and Decidability. [REVIEW]Pedro Baltazar - 2013 - Logica Universalis 7 (4):403-440.
Presuppositional completeness.Wojciech Buszkowski - 1989 - Studia Logica 48 (1):23 - 34.
The Bernays—Schönfinkel—Ramsey class for set theory: decidability.Alberto Policriti & Eugenio Omodeo - 2012 - Journal of Symbolic Logic 77 (3):896-918.
Review: Wolfram Schwabhäuser, On Completeness and Decidability of Some Non-Definable Notions of Elementary Hyperbolic Geometry. [REVIEW]Lesław W. Szczerba - 1971 - Journal of Symbolic Logic 36 (1):156-156.
A note on generalized functional completeness in the realm of elementrary logic.Henri Galinon - 2009 - Bulletin of the Section of Logic 38 (1/2):1-9.
Graded modalities. I.M. Fattorosi-Barnaba & F. Caro - 1985 - Studia Logica 44 (2):197 - 221.
Decidability of an Xstit Logic.Gillman Payette - 2014 - Studia Logica 102 (3):577-607.
Three theorems of Godel.Andrew Boucher - manuscript
Completeness and decidability of tense logics closely related to logics above K.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
An elementary completeness proof for a system of natural deduction.David W. Bennett - 1973 - Notre Dame Journal of Formal Logic 14 (3):430-432.
Review: Wladyslaw Hetper, Problem of Completeness of the System of Elementary Semantics. [REVIEW]Helen Brodie - 1940 - Journal of Symbolic Logic 5 (2):75-76.
Adding a temporal dimension to a logic system.Marcelo Finger & Dov M. Gabbay - 1992 - Journal of Logic, Language and Information 1 (3):203-233.
Taming logic.Maarten Marx, Szabolcs Mikul & István Németi - 1995 - Journal of Logic, Language and Information 4 (3):207-226.
Epsilon substitution method for elementary analysis.Grigori Mints, Sergei Tupailo & Wilfried Buchholz - 1996 - Archive for Mathematical Logic 35 (2):103-130.

Analytics

Added to PP
2013-12-01

Downloads
32 (#502,794)

6 months
5 (#648,018)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references