The purpose of this paper is to give a purely logical proof of a result of Mostowski [1937] concerning the complete theories of a calculus based on classical propositional logic; and then modestly to generalize it. Mostow-ski’s result is announced by Tarski on p. 370 of Logic, Semantics, Meta-mathematics [1956]. (All references to Tarski’s work here are to this book.) Tarski himself provides only a fragment of a proof, and the proof published by Mostowski makes extensive use of topological methods and results. The a proof offered here is undoubtedly longer than Mostowski’s and not by any means independent of it. But it should not be beyond the powers of any-one who has followed assiduously a couple of courses in propositional logic and know...
In this paper some results are found about the validity of a Deduction Theorem for the complete axio...
AbstractWe investigate semantics for classical proof based on the sequent calculus. We show that the...
Three papers were written in partial fulfillment of the requirements for the Fenwick Scholar Program...
International audienceDefining a theory, such as arithmetic, geometry, or set theory, in predicate l...
One of the goals for any logic is to systematize and codify principles of valid reasoning.Mathematic...
AbstractThis paper deals with Tarski's first axiomatic presentations of the syntax of deductive syst...
In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T...
This book continues from where the authors' previous book, Structural Proof Theory, ended. It presen...
We seek means of distinguishing logical knowledge from other kinds of knowledge, especially mathemat...
AbstractSome properties of the roots of theories, and the relationship between the sets D(Γ) of all ...
H. Hermes: Basic notions and applications of the theory of decidability.- D. Kurepa: On several cont...
We try to explain Tarski's conception of logical notions, as it emerges from a lecture of his, deliv...
A book which efficiently presents the basics of propositional and predicate logic, van Dalen’s popul...
We investigate semantics for classical proof based on the sequent calculus. We show that the proposi...
The proof of completeness for propositional logic is a constructive one, so a computer program is su...
In this paper some results are found about the validity of a Deduction Theorem for the complete axio...
AbstractWe investigate semantics for classical proof based on the sequent calculus. We show that the...
Three papers were written in partial fulfillment of the requirements for the Fenwick Scholar Program...
International audienceDefining a theory, such as arithmetic, geometry, or set theory, in predicate l...
One of the goals for any logic is to systematize and codify principles of valid reasoning.Mathematic...
AbstractThis paper deals with Tarski's first axiomatic presentations of the syntax of deductive syst...
In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T...
This book continues from where the authors' previous book, Structural Proof Theory, ended. It presen...
We seek means of distinguishing logical knowledge from other kinds of knowledge, especially mathemat...
AbstractSome properties of the roots of theories, and the relationship between the sets D(Γ) of all ...
H. Hermes: Basic notions and applications of the theory of decidability.- D. Kurepa: On several cont...
We try to explain Tarski's conception of logical notions, as it emerges from a lecture of his, deliv...
A book which efficiently presents the basics of propositional and predicate logic, van Dalen’s popul...
We investigate semantics for classical proof based on the sequent calculus. We show that the proposi...
The proof of completeness for propositional logic is a constructive one, so a computer program is su...
In this paper some results are found about the validity of a Deduction Theorem for the complete axio...
AbstractWe investigate semantics for classical proof based on the sequent calculus. We show that the...
Three papers were written in partial fulfillment of the requirements for the Fenwick Scholar Program...