Related papers: Non-Compact Proofs

We define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive…

Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…

In this article, we consider the notion of almost irredundant sets: A subset $\mathcal{X}$ of a C*-algebra $\mathcal{A}$ is called almost irredundant if and only if for every $a\in \mathcal{X}$, the element $a$ does not belong to the…

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…

Mostow's Decomposition Theorem is a refinement of the polar decomposition. It states the following. Let G be a compact connected semi-simple Lie group with Lie algebra g. Given a subspace h of g such that [X, [X, Y]] belongs to h for all X…

In an earlier paper, "Omega-inconsistency in Goedel's formal system: a constructive proof of the Entscheidungsproblem" (math/0206302), I argued that a constructive interpretation of Goedel's reasoning establishes any formal system of…

Theorems crucial in elementary real function theory have proofs in which compactness arguments are used. Despite the introduction in relatively recent literature of each new highly elegant compactness argument, or of an equivalent, this…

We show a number of undecidable assertions concerning countably compact spaces hold under PFA(S)[S]. We also show the consistency without large cardinals of "every locally compact, perfectly normal space is paracompact".

We prove that for any FAb compact $p$-adic analytic group $G$, its representation zeta function is a finite sum of terms $n_{i}^{-s}f_{i}(p^{-s})$, where $n_{i}$ are natural numbers and $f_{i}(t)\in\mathbb{Q}(t)$ are rational functions.…

A nonconstructive proof can be used to prove the existence of an object with some properties without providing an explicit example of such an object. A special case is a probabilistic proof where we show that an object with required…

We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least as strong as Frege---yielding a semantic way to define a…

Bottom-up knowledge compilation is a paradigm for generating representations of functions by iteratively conjoining constraints using a so-called apply function. When the input is not efficiently compilable into a language - generally a…

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

The main result of this paper is the proof of the simultaneous consistency, modulo a weakly compact cardinal, of the equality $2^{< \mathfrak{c}} = \mathfrak{c}$ with the following property (*) of partitions of pairs of $\mathfrak{c}$:…

In this work, we prove the existence of solutions for a tripled system of integral equations using some new results of fixed point theory associated with measure of noncompactness. These results extend some previous works in the literature,…

We exhibit a uniform method for obtaining (wellfounded and non-wellfounded) cut-free sequent-style proof systems that are sound and complete for various classes of action algebras, i.e., Kleene algebras enriched with meets and residuals.…

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Plausible reasoning concerns situations whose inherent lack of precision is not quantified; that is, there are no degrees or levels of precision, and hence no use of numbers like probabilities. A hopefully comprehensive set of principles…

Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper, we use constructive type theory as a framework to revisit,…