A Frege proof systemFis any standard system of prepositional calculus, e.g., a Hilbert style system based on finitely many axiom schemes and inference rules. An Extended Frege systemEFis obtained fromFas follows. AnEF-sequence is a sequence of formulas ψ1, …, ψκsuch that eachψiis either an axiom ofF, inferred from previous ψuand ψv by modus ponens or of the formq↔ φ, whereqis an atom occurring neither in φ nor in any of ψ1,…,ψi−1. Suchq↔ φ, is called an extension axiom andqa (...) new extension atom. AnEF-proof is anyEF-sequence whose last formula does not contain any extension atom. In [12], S. A. Cook and R. Reckhow proved that the pigeonhole principlePHPhas a simple polynomial sizeEF-proof and conjectured thatPHPdoes not admit polynomial sizeF-proof. In [5], S. R. Buss refuted this conjecture by furnishing polynomial sizeF-proof forPHP. Since then the important separation problem of polynomial sizeFand polynomial sizeEFhas not shown any progress.In [11], S. A. Cook introduced the systemPV, a free variable equational logic whose provable functional equalities are ‘polynomial time verifiable’ and showed that the metamathematics ofFandEFcan be developed inPVand the soundness ofEFproved inPV. In [3], S. R. Buss introduced the first order systemand showed thatis essentially a conservative extension ofPV. There he also introduced a second order system. (shrink)

We investigate the substitution Frege () proof system and its relationship to extended Frege () in the context of modal and superintuitionistic propositional logics. We show that is p-equivalent to tree-like , and we develop a “normal form” for -proofs. We establish connections between for a logic L, and for certain bimodal expansions of L.We then turn attention to specific families of modal and si logics. We prove p-equivalence of and for all extensions of , all tabular (...) logics, all logics of finite depth and width, and typical examples of logics of finite width and infinite depth. In most cases, we actually show an equivalence with the usual system for classical logic with respect to a naturally defined translation.On the other hand, we establish exponential speed-up of over for all modal and si logics of infinite branching, extending recent lower bounds by P. Hrubeš. We develop a model-theoretical characterization of maximal logics of infinite branching to prove this result. (shrink)

We extend results of Bonet, Buss and Pitassi on Bondy’s Theorem and of Nozaki, Arai and Arai on Bollobás’ Theorem by proving that Frankl’s Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant values of the parametert, we prove that Frankl’s Theorem has polynomial size AC0-Frege proofs from instances of the pigeonhole principle.

Sam Buss produced the first polynomial size Frege proof of thepigeonhole principle. We introduce a variation of that problem and producea simpler proof based on parity. The proof appearing here has an upperbound that is quadratic in the size of the input formula.

We prove that for sufficiently large \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $n$\end{document}, there are tautologies of size \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $O(n)$\end{document} that require proofs containing \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\Omega( n / \log n )$\end{document} lines in axiomatic systems of propositional logic based on the rules of substitution and detachment.

The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of the logic. The existence of a polynomial bound on proof complexity of every statement provable in this logic is a well-known open question.The axiomatization consists of three schemata. We show that any statement provable using unrestricted number of axioms from the first of the three schemata and polynomially-bounded in size set of axioms from the (...) other schemata, has a polynomially-bounded proof complexity. In addition, it is also established, that any statement, provable using unrestricted number of axioms from the remaining two schemata and polynomially-bounded in size set of axioms from the first scheme, also has a polynomially-bounded proof complexity. (shrink)

I present a novel interpretation of Frege’s attempt at Grundgesetze I §§29-31 to prove that every expression of his language has a unique reference. I argue that Frege’s proof is based on a contextual account of reference, similar to but more sophisticated than that enshrined in his famous Context Principle. Although Frege’s proof is incorrect, I argue that the account of reference on which it is based is of potential philosophical value, and I analyze the class of (...) cases to which it may successfully be applied. (shrink)

Frege's account of indirect proof has been thought to be problematic. This thought seems to rest on the supposition that some notion of logical consequence ? which Frege did not have ? is indispensable for a satisfactory account of indirect proof. It is not so. Frege's account is no less workable than the account predominant today. Indeed, Frege's account may be best understood as a restatement of the latter, although from a higher order point of view. (...) I argue that this ascent is motivated by Frege's conception of logic. (shrink)

It is widely believed that some puzzling and provocative remarks that Frege makes in his late writings indicate he rejected independence arguments in geometry, particularly arguments for the independence of the parallels axiom. I show that this is mistaken: Frege distinguished two approaches to independence arguments and his puzzling remarks apply only to one of them. Not only did Frege not reject independence arguments across the board, but also he had an interesting positive proposal about the logical (...) structure of correct independence arguments, deriving from the geometrical principle of duality and the associated idea of substitution invariance. The discussion also serves as a useful focal point for independently interesting details of Frege's mathematical environment. This feeds into a currently active scholarly debate because Frege's supposed attitude to independence arguments has been taken to support a widely accepted thesis (proposed by Ricketts among others) concerning Frege's attitude toward metatheory in general. I show that this thesis gains no support from Frege's puzzling remarks about independence arguments. (shrink)

We study the complexity of proving the Pigeon Hole Principle in a monotone variant of the Gentzen Calculus, also known as Geometric Logic. We prove a size-depth trade-off upper bound for monotone proofs of the standard encoding of the PHP as a monotone sequent. At one extreme of the trade-off we get quasipolynomia -size monotone proofs, and at the other extreme we get subexponential-size bounded-depth monotone proofs. This result is a consequence of deriving the basic properties of (...) certain monotone formulas computing the Boolean threshold functions. We also consider the monotone sequent expressing the Clique-Coclique Principle defined by Bonet, Pitassi and Raz [9]. We show that monotone proofs for this sequent can be easily reduced to monotone proofs of the one-to-one and onto PHP, and so CLIQUE also has quasipolynomia -size monotone proofs. As a consequence of our results, Resolution, Cutting Planes with polynomially bounded coefficients, and Bounded-Depth Frege are exponentially separated from the monotone Gentzen Calculus. Finally, a simple simulation argument implies that these results extend to the Intuitionistic Gentzen Calculus. Our results partially answer some questions left open by P. Pudlák. (shrink)

We present a general method for inserting proofs in Frege systems for classical logic that produces systems that can internalize their own proofs.

In the first chapter, we discuss Dummett’s idea that the notion of truth arises from the one of the correctness of an assertion. We argue that, in a first-order language, the need of defining truth in terms of the notion of satisfaction, which is yielded by the presence of quantifiers, is structurally analogous to the need of a notion of truth as distinct from the one of correctness of an assertion. In the light of the analogy between predicates in (...) class='Hi'>Frege and open formulas in Tarksi, we concentrate on the semantic status of predicates. We register a dual attitude of Dummett towards Frege’s ascription of reference to predicates. On the one it is needed to endow quantifiers with their appropriate meaning. On the other hand, the introduction of concepts, as semantic correlate of predicates, smuggles a realist flavor in the overall semantic picture. In concluding the excursus (and with it the chapter), we stress Dummett’s will of developing a semantic picture free from this realist trait. In the second chapter, we present the idea of a proof-theoretic semantics. As for Frege true sentences denotes the truth-value True, so here closed' (i.e. categorical) valid argumentations denotes proofs. If a language contains implication-like operators, in order to characterize the condition of validity of a closed argumentation one has to introduce a notion of validity applying to ‘open’ (i.e. hypothetical) argumentations. We argue that this problem is analogous to the one posed by quantifiers in Frege-Tarksi’s style semantics. That is, implication forces one to introduce notion of validity for argumentations, which is more substantial than the correctness of the assertion of their conclusions. As we saw, the corresponding claim in the truth-based approach—that quantifiers require one to introduce a notion of truth, which is more substantial than the one of an assertion being correct—was the source of realism. Hence, Dummett proposes to reduce the semantic contribution of open argumentations to the one of their ‘closed instances’. In the truth-based perspective, this would correspond to the denial of the need of introducing concepts as the semantic correlates of predicates. We argue that Dummett’s fear, that an irreducible notion of function (represented by the need of ascribing validity to open argumentations) would lead to realism, turns out to be ill-founded. In the third chapter, we discuss the role played by the notion of truth in the anti-realist account. The notion of truth is what the anti-realist needs to cope with the so-called paradox of deduction. The analysis of the paradox yields to distinguishing between the truth of a sentence and the truth of a sentence being recognized. In terms of these conceptual couple, we reconsider the relationship between truth and assertion in an anti-realist perspective. Grounds are provided for a thesis (which was already advanced in chapter two), according to which the notion of the assertion of a sentence being correct is primarily connected only with the canonical means of establishing a sentence. The possibility of establishing a sentence by indirect means is conceptually dependent on the practice of establishing logical relationship of dependence among sentences. That is, the notion of a closed valid non-canonical argumentation is of any theoretical relevance only in presence of a notion of validity applying to open argumentations. In the fourth chapter, we discuss the possibility of characterizing in the proof-theoretic-semantics a notion of refutation. We develop an original characterization of refutations starting from an informal inductive specification of the condition of refutations of logically complex sentences. A sub-structural logic, called dual-intuitionistic logic, stands to this notion in the same relationship in which intuitionistic logic stands to the notion of proof so far consdered. All notions developed in chapter 2 have their corresponding (dual) ones in the framework developed. In particular, the distinctions canonical/non-canonical and closed/open argumentations. In the refutation based perspective, elimination rules have priority over introductions and the (only) assumption over the (many) conclusions. In the conclusions, we indicate the ingredients that an anti-realist approach to meaning should incorporate, in order to avoid the difficulties we registered. The core of an alternative view is a different conception of the relationship between categorical and hypothetical notions, in which the validity of open argumentations is not reduced to that of their instances, but rather it is directly defined. As a limit case, one would get a notion of validity applying to closed argumentations. (shrink)

ABSTRACTIn this paper, we present a generalisation of proof simulation procedures for Frege systems by Bonet and Buss to some logics for which the deduction theorem does not hold. In particular, we study the case of finite-valued Łukasiewicz logics. To this end, we provide proof systems and which augment Avron's Frege system HŁuk with nested and general versions of the disjunction elimination rule, respectively. For these systems, we provide upper bounds on speed-ups w.r.t. both the number of steps (...) in proofs and the length of proofs. We also consider Tamminga's natural deduction and Avron's hypersequent calculus GŁuk for 3-valued Łukasiewicz logic and generalise our results considering the disjunction elimination rule to all finite-valued Łukasiewicz logics. (shrink)

Cook and Reckhow defined a propositional formulation of the pigeonhole principle. This paper shows that there are Frege proofs of this propositional pigeonhole principle of polynomial size. This together with a result of Haken gives another proof of Urquhart's theorem that Frege systems have an exponential speedup over resolution. We also discuss connections to provability in theories of bounded arithmetic.

The paper briefly surveys the sentential proof-theoretic semantics for fragment of English. Then, appealing to a version of Frege’s context-principle (specified to fit type-logical grammar), a method is presented for deriving proof-theoretic meanings for sub-sentential phrases, down to lexical units (words). The sentential meaning is decomposed according to the function-argument structure as determined by the type-logical grammar. In doing so, the paper presents a novel proof-theoretic interpretation of simple type, replacing Montague’s model-theoretic type interpretation (in arbitrary Henkin models). The (...) domains of derivations are collections of derivations in the associated “dedicated” natural-deduction proof-system, and functions therein (with no appeal to models, truth-values and elements of a domain). The compositionality of the semantics is analyzed. (shrink)

A Ramsey statement denoted \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${n \longrightarrow (k)^2_2}$$\end{document} says that every undirected graph on n vertices contains either a clique or an independent set of size k. Any such valid statement can be encoded into a valid DNF formula RAM(n, k) of size O(nk) and with terms of size \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\left(\begin{smallmatrix}k\\2\end{smallmatrix}\right)}$$\end{document}. Let rk be the minimal n for which the statement holds. We prove that (...) RAM(rk, k) requires exponential size constant depth Frege systems, answering a problem of Krishnamurthy and Moll [15]. As a consequence of Pudlák’s work in bounded arithmetic [19] it is known that there are quasi-polynomial size constant depth Frege proofs of RAM(4k, k), but the proof complexity of these formulas in resolution R or in its extension R(log) is unknown. We define two relativizations of the Ramsey statement that still have quasi-polynomial size constant depth Frege proofs but for which we establish exponential lower bound for R. (shrink)

Partial consistency statements can be expressed as polynomial-size propositional formulas. Frege proof systems have polynomial-size partial self-consistency proofs. Frege proof systems have polynomial-size proofs of partial consistency of extended Frege proof systems if and only if Frege proof systems polynomially simulate extended Frege proof systems. We give a new proof of Reckhow's theorem that any two Frege proof systems p-simulate each other. The proofs depend on polynomial size propositional formulas defining the (...) truth of propositional formulas. These are already known to exist since the Boolean formula value problem is in alternating logarithmic time; this paper presents a proof of this fact based on a construction which is somewhat simpler than the prior proofs of Buss and of Buss-Cook- Gupta-Ramachandran. (shrink)

Kant discovered a philosophical problem with mathematical proof. Despite being a priori , its methodology involves more than analytic truth. But what else is involved? This problem is widely taken to have been solved by Frege’s extension of logic beyond its restricted (and largely Aristotelian) form. Nevertheless, a successor problem remains: both traditional and contemporary (classical) mathematical proofs, although conforming to the norms of contemporary (classical) logic, never were, and still aren’t, executed by mathematicians in a way that (...) transparently reveals why these proofs—written in the vernacular to this very day—succeed in conforming to those norms. (shrink)

In this article, I try to shed some new light onGrundgesetze§10, §29–§31 with special emphasis on Frege’s criteria and proof of referentiality and his treatment of the semantics of canonical value-range names. I begin by arguing against the claim, recently defended by several Frege scholars, that the first-order domain inGrundgesetzeis restricted to value-ranges, but conclude that there is an irresolvable tension in Frege’s view. The tension has a direct impact on the semantics of the concept-script, not least (...) on the semantics of value-range names. I further argue that despite first appearances truth-value names play a distinguished role as semantic “target names” for “test names” in the criteria of referentiality and do not figure themselves as “test names” regarding referentiality. Accordingly, I show in detail that Frege’s attempt to demonstrate that by virtue of his stipulations “regular” value-range names have indeed been endowed with a unique reference, can plausibly be regarded as a direct application of the context principle. In a subsequent section, I turn to some special issues involved in §10. §10 is closely intertwined with §31 and in my and Richard Heck’s view would have been better positioned between §30 and §31. In a first step, I discuss the piecemeal strategy which Frege applies when he attempts to bestow a unique reference on value-range names in §3, §10–§12. In a second step, I critically analyze his tentative, but predictably unsuccessful proposal to identify all objects whatsoever, including those already clad in the garb of value-ranges, with their unit classes. In conclusion, I present two arguments for my claim that Frege’s identification of the True and the False with their unit classes in §10 is illicit even if both the permutation argument and the identifiability thesis that he states in §10 are regarded as formally sound. The first argument is set out from the point of view of the syntax of his formal language. It suggests though that a reorganization of the exposition of the concept-script would have solved at least one of the problems to which the twin stipulations in §10 give rise. The second argument rests on semantic considerations. If it is sound, it may call into question, if not undermine the legitimacy of the twin stipulations. (shrink)

Sections “Introduction: Hume’s Principle, Basic Law V and Cardinal Arithmetic” and “The Julius Caesar Problem in Grundlagen—A Brief Characterization” are peparatory. In Section “Analyticity”, I consider the options that Frege might have had to establish the analyticity of Hume’s Principle, bearing in mind that with its analytic or non-analytic status the intended logical foundation of cardinal arithmetic stands or falls. Section “Thought Identity and Hume’s Principle” is concerned with the two criteria of thought identity that Frege states in (...) 1906 and their application to Hume’s Principle. In Section “The Nature ofion: A Critical Assessment of Grundlagen, §64”, I scrutinize Frege’s characterization of abstraction in Grundlagen, §64 and criticize in this context the currently widespread use of the terms “recarving” and “reconceptualization”. Section “Frege’s Proof of Hume’s Principle” is devoted to the formal details of Frege’s proof of Hume’s Principle. I begin by considering his proof sketch in Grundlagen and subsequently reconstruct in modern notation essential parts of the formal proof in Grundgesetze. In Section “Equinumerosity and Coextensiveness: Hume’s Principle and Basic Law V Again”, I discuss the criteria of identity embodied in Hume’s Principle and in Basic Law V, equinumerosity and coextensiveness. In Section “Julius Caesar and Cardinal Numbers—A Brief Comparison Between Grundlagen and Grundgesetze ”, I comment on the Julius Caesar problem arising from Hume’s Principle in Grundlagen and analyze the reasons for its absence in this form in Grundgesetze. I conclude with reflections on the introduction of the cardinals and the reals by abstraction in the context of Frege’s logicism. (shrink)

We present a proof-theoretical analysis of the theory of definite descriptions which emerges from Frege’s approach and was formally developed by Kalish and Montague. This theory of definite descriptions is based on the assumption that all descriptions are treated as genuine terms. In particular, a special object is chosen as a designatum for all descriptions which fail to designate a unique object. Kalish and Montague provided a semantical treatment of such theory as well as complete axiomatic and natural deduction (...) formalization. In the paper we provide a sequent calculus formalization of this logic and prove cut elimination theorem in the constructive manner. (shrink)

In his Grundgesetze, §32, Frege launched the idea that the meaning of a sentence is given by its truth condition, or, in his particular version, the condition under which it will be a name of the True. This, indeed, was only one of the many roles in which truth has to serve within the Fregean system. In particular, truth is an absolute notion in the sense that bivalence holds: every Gedanke is either true or false, in complete independence of (...) any conative activity, whether by God or man. Thus various epistemological notions, such as the correctness of an assertion made, or judgement passed, are reducible to this absolute notion of truth: an assertion made through the utterance of a declarative sentence is correct when the proposition expressed by the sentence in question is true. Given this absolute status of truth it is not surprising that Frege is of the opinion that truth is a sui generis notion which has to be left unanalyzed and, indeed, which is indefinable. (shrink)

In this paper, we discuss the prevailing view amongst philosophers and many mathematicians concerning mathematical proof. Following Cellucci, we call the prevailing view the “axiomatic conception” of proof. The conception includes the ideas that: a proof is finite, it proceeds from axioms and it is the final word on the matter of the conclusion. This received view can be traced back to Frege, Hilbert and Gentzen, amongst others, and is prevalent in both mathematical text books and logic text books.

In this paper we give some formal examples of ideas developed by Penco in two papers on the tension inside Frege's notion of sense (see Penco 2003). The paper attempts to compose the tension between semantic and cognitive aspects of sense, through the idea of sense as proof or procedure – not as an alternative to the idea of sense as truth condition, but as complementary to it (as it happens sometimes in the old tradition of procedural semantics).

We survey the best known lower bounds on symbols and lines in Frege and extended Frege proofs. We prove that in minimum length sequent calculus proofs, no formula is generated twice or used twice on any single branch of the proof. We prove that the number of distinct subformulas in a minimum length Frege proof is linearly bounded by the number of lines. Depthd Frege proofs ofm lines can be transformed into depthd (...) class='Hi'>proofs ofO(m d+1) symbols. We show that renaming Frege proof systems are p-equivalent to extended Frege systems. Some open problems in propositional proof length and in logical flow graphs are discussed. (shrink)

We consider small-weight Cutting Planes (CP * ) proofs; that is, Cutting Planes (CP) proofs with coefficients up to $\operatorname{Poly}(n)$ . We use the well known lower bounds for monotone complexity to prove an exponential lower bound for the length of CP * proofs, for a family of tautologies based on the clique function. Because Resolution is a special case of small-weight CP, our method also gives a new and simpler exponential lower bound for Resolution. We also (...) prove the following two theorems: (1) Tree-like CP * proofs cannot polynomially simulate non-tree-like CP * proofs. (2) Tree-like (CP * proofs and Bounded-depth-Frege proofs cannot polynomially simulate each other. Our proofs also work for some generalizations of the CP * proof system. In particular, they work for CP * with a deduction rule, and also for any proof system that allows any formula with small communication complexity, and any set of sound rules of inference. (shrink)

In this paper, we explore Fregean metatheory, what Frege called the New Science. The New Science arises in the context of Frege’s debate with Hilbert over independence proofs in geometry and we begin by considering their dispute. We propose that Frege’s critique rests on his view that language is a set of propositions, each immutably equipped with a truth value (as determined by the thought it expresses), so to Frege it was inconceivable that axioms could (...) even be considered to be other than true. Because of his adherence to this view, Frege was precluded from the sort of metatheoretical considerations that were available to Hilbert; but from this, we shall argue, it does not follow that Frege was blocked from metatheory in toto. Indeed, Frege suggests in Die Grundlagen der Geometrie a metatheoretical method for establishing independence proofs in the context of the New Science. Frege had reservations about the method, however, primarily because of the apparent need to stipulate the logical terms, those terms that must be held invariant to obtain such proofs. We argue that Frege’s skepticism on this score is not warranted, by showing that within the New Science a characterization of logical truth and logical constant can be obtained by a suitable adaptation of the permutation argument Frege employs in indicating how to prove independence. This establishes a foundation for Frege’s metatheoretical method of which he himself was unsure, and allows us to obtain a clearer understanding of Frege’s conception of logic, especially in relation to contemporary conceptions. (shrink)

We discuss the semantical categories of base and object implicit in the Curry-Howard theory of types and we derive derive logic and, in particular, the comprehension principle in the classical version of the theory. Two results that apply to both the classical and the constructive theory are discussed. First, compositional semantics for the theory does not demand ‘incomplete objects’ in the sense of Frege: bound variables are in principle eliminable. Secondly, the relation of extensional equality for each type is (...) definable in the Curry-Howard theory. (shrink)

LK is a natural modification of Gentzen sequent calculus for propositional logic with connectives ¬ and $\bigwedge, \bigvee$. Then for every d ≥ 0 and n ≥ 2, there is a set Td n of depth d sequents of total size O which are refutable in LK by depth d + 1 proof of size exp) but such that every depth d refutation must have the size at least exp). The sets Td n express a weaker form of the pigeonhole (...) principle. (shrink)

Frege says, at the end of a discussion of formalism in the Foundations of Arithmetic, that his own foundational program “could be called formal” but is “completely different” from the view he has just criticized. This essay examines Frege’s relationship to Hermann Hankel, his main formalist interlocutor in the Foundations, in order to make sense of these claims. The investigation reveals a surprising result: Frege’s foundational program actually has quite a lot in common with Hankel’s. This undercuts (...) Frege’s claim that his own view is completely different from Hankel’s formalism, and motivates a closer examination of where the differences lie. On the interpretation offered here, Frege shares important parts of the formalist perspective, but differs in recognizing a kind of content for arithmetical terms which can only be made available via proof from prior postulates. (shrink)

We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems, and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in Frege proof systems compared to lengths in these new systems. As applications we give near-linear simulations of the propositional Gentzen sequent calculus and the natural deduction calculus by Frege proofs. The length (...) of a proof is the number of lines in the proof. A general deduction Frege proof system provides at most quadratic speedup over Frege proof systems. A nested deduction Frege proof system provides at most a nearly linear speedup over Frege system where by "nearly linear" is meant the ratio of proof lengths is O) where α is the inverse Ackermann function. A nested deduction Frege system can linearly simulate the propositional sequent calculus, the tree-like general deduction Frege calculus, and the natural deduction calculus. Hence a Frege proof system can simulate all those proof systems with proof lengths bounded by O). Also we show that a Frege proof of n lines can be transformed into a tree-like Frege proof of O lines and of height O. As a corollary of this fact we can prove that natural deduction and sequent calculus tree-like systems simulate Frege systems with proof lengths bounded by O. (shrink)

Interesting as they are by themselves in philosophy and mathematics, paradoxes can be made even more fascinating when turned into proofs and theorems. For example, Russell’s paradox, which overthrew Frege’s logical edifice, is now a classical theorem in set theory, to the effect that no set contains all sets. Paradoxes can be used in proofs of some other theorems—thus Liar’s paradox has been used in the classical proof of Tarski’s theorem on the undefinability of truth in sufficiently (...) rich languages. This paradox (as well as Richard’s paradox) appears implicitly in Gödel’s proof of his celebrated first incompleteness theorem. In this paper, we study Yablo’s paradox from the viewpoint of first- and second-order logics. We prove that a formalization of Yablo’s paradox (which is second order in nature) is non-first-orderizable in the sense of George Boolos (1984). (shrink)

We prove that the problem of determining the minimum propositional proof length is NP- hard to approximate within a factor of 2 log 1 - o(1) n . These results are very robust in that they hold for almost all natural proof systems, including: Frege systems, extended Frege systems, resolution, Horn resolution, the polynomial calculus, the sequent calculus, the cut-free sequent calculus, as well as the polynomial calculus. Our hardness of approximation results usually apply to proof length measured (...) either by number of symbols or by number of inferences, for tree-like or dag-like proofs. We introduce the Monotone Minimum (Circuit) Satisfying Assignment problem and reduce it to the problems of approximation of the length of proofs. (shrink)

Let g be a map defined as the Nisan–Wigderson generator but based on an NP ∩ coNP -function f. Any string b outside the range of g determines a propositional tautology τb expressing this fact. Razborov [27] has conjectured that if f is hard on average for P/poly then these tautologies have no polynomial size proofs in the Extended Frege system EF. We consider a more general Statement that the tautologies have no polynomial size proofs in any (...) propositional proof system. This is equivalent to the statement that the complement of the range of g contains no infinite NP set. We prove that Statement is consistent with Cook' s theory PV and, in fact, with the true universal theory T PV in the language of PV. If PV in this consistency statement could be extended to "a bit" stronger theory then Razborov's conjecture would follow, and if TPV could be added too then Statement would follow. We discuss this problem in some detail, pointing out a certain form of reflection principle for propositional logic, and we introduce a related feasible disjunction property of proof systems. (shrink)

In the last two decades, there has been increasing interest in a re-evaluation of Frege’s stance towards consistency- and independence proofs. Papers by several authors deal with Frege’s views on these topics. In this note, I want to discuss one particular problem, which seems to be a main reason for Frege’s reluctant attitude towards his own proposed method of proving the independence of axioms, namely his view that thoughts, that is, intensional entities are the objects of (...) metatheoretical investigations. This stands in contrast to more straightforward interpretations, which claim that Frege’s hesitancy is mainly due to worries concerning the logical constants or what counts as a logical inference. (shrink)

Gottlob Frege's Grundgesetze der Arithmetik, or Basic Laws of Arithmetic, was intended to be his magnum opus, the book in which he would finally establish his logicist philosophy of arithmetic. But because of the disaster of Russell's Paradox, which undermined Frege's proofs, the more mathematical parts of the book have rarely been read. Richard G.

The origins of proof-theoretic semantics lie in the question of what constitutes the meaning of the logical connectives and its response: the rules of inference that govern the use of the connective. However, what if we go a step further and ask about the meaning of a proof as a whole? In this paper we address this question and lay out a framework to distinguish sense and denotation of proofs. Two questions are central here. First of all, if we (...) have two different derivations, does this always lead to a difference, firstly, in sense, and secondly, in denotation? The other question is about the relation between different kinds of proof systems with respect to this distinction. Do the different forms of representing a proof necessarily correspond to a difference in how the inferential steps are given? In our framework it will be possible to identify denotation as well as sense of proofs not only within one proof system but also between different kinds of proof systems. Thus, we give an account to distinguish a mere syntactic divergence from a divergence in meaning and a divergence in meaning from a divergence of proof objects analogous to Frege’s distinction for singular terms and sentences. (shrink)

The purpose of this paper is to survey the correspondence between bounded arithmetic and propositional proof systems. In addition, it also contains some new results which have appeared as an extended abstract in the proceedings of the conference TAMC 2008 [11].Bounded arithmetic is closely related to propositional proof systems; this relation has found many fruitful applications. The aim of this paper is to explain and develop the general correspondence between propositional proof systems and arithmetic theories, as introduced by Krajíček and (...) Pudlák [46]. Instead of focusing on the relation between particular proof systems and theories, we favour a general axiomatic approach to this correspondence. In the course of the development we particularly highlight the role played by logical closure properties of propositional proof systems, thereby obtaining a characterization of extensions of EF in terms of a simple combination of these closure properties (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

Frege's Grundgesetze was one of the 19th century forerunners to contemporary set theory which was plagued by the Russell paradox. In recent years, it has been shown that subsystems of the Grundgesetze formed by restricting the comprehension schema are consistent. One aim of this paper is to ascertain how much set theory can be developed within these consistent fragments of the Grundgesetze, and our main theorem shows that there is a model of a fragment of the Grundgesetze which defines (...) a model of all the axioms of Zermelo-Fraenkel set theory with the exception of the power set axiom. The proof of this result appeals to G\"odel's constructible universe of sets, which G\"odel famously used to show the relative consistency of the continuum hypothesis. More specifically, our proofs appeal to Kripke and Platek's idea of the projectum within the constructible universe as well as to a weak version of uniformization (which does not involve knowledge of Jensen's fine structure theory). The axioms of the Grundgesetze are examples of abstraction principles, and the other primary aim of this paper is to articulate a sufficient condition for the consistency of abstraction principles with limited amounts of comprehension. As an application, we resolve an analogue of the joint consistency problem in the predicative setting. (shrink)

Gottlob Frege famously rejects the methodology for consistency and independence proofs offered by David Hilbert in the latter's Foundations of Geometry. The present essay defends against recent criticism the view that this rejection turns on Frege's understanding of logical entailment, on which the entailment relation is sensitive to the contents of non-logical terminology. The goals are (a) to clarify further Frege's understanding of logic and of the role of conceptual analysis in logical investigation, and (b) to (...) point out the extent to which his understanding of logic differs importantly from that of the model-theoretic tradition that grows out of Hilbert's work. (shrink)

In Part III of his 1879 logic Frege proves a theorem in the theory of sequences on the basis of four definitions. He claims in Grundlagen that this proof, despite being strictly deductive, constitutes a real extension of our knowledge, that it is ampliative rather than merely explicative. Frege furthermore connects this idea of ampliative deductive proof to what he thinks of as a fruitful definition, one that draws new lines. My aim is to show that we can (...) make good sense of these claims if we read Frege’s notation diagrammatically, in particular, if we take that notation to have been designed to enable one to exhibit the (inferentially articulated) contents of concepts in a way that allows one to reason deductively on the basis of those contents. (shrink)

The intention here is that of giving a formal underpinning to the idea of ‘meaning-is-use’ which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett–Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i.e. the so-called reduction rules. For that we suggest an (...) extension to the Curry– Howard interpretation which draws on the idea of labelled deduction, and brings back Frege’s device of variable-abstraction to operate on the labels (i.e., proof-terms) alongside formulas of predicate logic. (shrink)

Controversy remains over exactly why Frege aimed to estabish logicism. In this essay, I argue that the most influential interpretations of Frege's motivations fall short because they misunderstand or neglect Frege's claims that axioms must be self-evident. I offer an interpretation of his appeals to self-evidence and attempt to show that they reveal a previously overlooked motivation for establishing logicism, one which has roots in the Euclidean rationalist tradition. More specifically, my view is that Frege had (...) two notions of self-evidence. One notion is that of a truth being foundationally secure, yet not grounded on any other truth. The second notion is that of a truth that requires only clearly grasping its content for rational, a priori justified recognition of its truth. The overarching thesis I develop is that Frege required that axioms be self-evident in both senses, and he relied on judging propositions to be self-evident as part of his fallibilist method for identifying a foundation of arithmetic. Consequently, we must recognize both notions in order to understand how Frege construes ultimate foundational proofs, his methodology for discovering and identifying such proofs, and why he thought the propositions of arithmetic required proof. (shrink)

This analysis of Frege's views on language and metaphysics in On Sense and Reference, arguably one of the most important philosophical essays of the past hundred years, provides a thorough introduction to the function/argument analysis and applies Frege's technique to the central notions of predication, identity, existence and truth. Of particular interest is the analysis of the Paradox of Identity and a discussion of three solutions: the little-known Begriffsschrift solution, the sense/reference solution, and Russell's 'On Denoting' solution. Russell's (...) views wend their way through the work, serving as a foil to Frege. Appendices give the proofs of the first 68 propositions of Begriffsschrift in modern notation. This book will be of interest to students and professionals in philosophy and linguistics. (shrink)