A minimal classical sequent calculus free of structural rules

Gentzen’s classical sequent calculus has explicit structural rules for contraction and weakening. They can be absorbed (in a right-sided formulation) by replacing the axiom P,¬P by Γ,P,¬P for any context Γ, and replacing the original disjunction rule with Γ,A,B implies Γ,A∨B.This paper presents a classical sequent calculus which is also free of contraction and weakening, but more symmetrically: both contraction and weakening are absorbed into conjunction, leaving the axiom rule intact. It uses a blended conjunction rule, combining the standard context-sharing and context-splitting rules: Γ,Δ,A and Γ,Σ,B implies Γ,Δ,Σ,A∧B. We refer to this system as minimal sequent calculus.We prove a minimality theorem for the propositional fragment : any propositional sequent calculus S (within a standard class of right-sided calculi) is complete if and only ifS contains (that is, each rule of is derivable in S). Thus one can view as a minimal complete core of Gentzen’s .     

Dependence of variables construed as an atomic formula

We define a logic D capable of expressing dependence of a variable on designated variables only. Thus D has similar goals to the Henkin quantifiers of [4] and the independence friendly logic of [6] that it much resembles. The logic D achieves these goals by realizing the desired dependence declarations of variables on the level of atomic formulas. By [3] and [17], ability to limit dependence relations between variables leads to existential second order expressive power. Our D avoids some difficulties arising in the original independence friendly logic from coupling the dependence declarations with existential quantifiers. As is the case with independence friendly logic, truth of D is definable inside D. We give such a definition for D in the spirit of [11] and [2] and [1].     

A focused approach to combining logics

We present a compact sequent calculus LKU for classical logic organized around the concept of polarization. Focused sequent calculi for classical, intuitionistic, and multiplicative-additive linear logics are derived as fragments of the host system by varying the sensitivity of specialized structural rules to polarity information. We identify a general set of criteria under which cut-elimination holds in such fragments. From cut-elimination we derive a unified proof of the completeness of focusing. Furthermore, each sublogic can interact with other fragments through cut. We examine certain circumstances, for example, in which a classical lemma can be used in an intuitionistic proof while preserving intuitionistic provability. We also examine the possibility of defining classical-linear hybrid logics.     

Selection over classes of ordinals expanded by monadic predicates

A monadic formula ψ(Y) is a selector for a monadic formula φ(Y) in a structure M if ψ defines in M a unique subset P of the domain and this P also satisfies φ in M. If C is a class of structures and φ is a selector for ψ in every M∈C, we say that φ is a selector for φ over C.For a monadic formula φ(X,Y) and ordinals α≤ω₁ and δ<ω^ω, we decide whether there exists a monadic formula ψ(X,Y) such that for every P⊆αof order-type smaller thanδ, ψ(P,Y) selects φ(P,Y) in (α,<). If so, we construct such a ψ.We introduce a criterion for a class C of ordinals to have the property that every monadic formula φ has a selector over it. We deduce the existence of S⊆ω^ω such that in the structure (ω^ω,<,S) every formula has a selector.Given a monadic sentence π and a monadic formula φ(Y), we decide whether φ has a selector over the class of countable ordinals satisfying π, and if so, construct one for it.     

Ergodic Banach spaces

We show that any Banach space contains a continuum of non-isomorphic subspaces or a minimal subspace. We define an ergodic Banach space X as a space such that E₀ Borel reduces to isomorphism on the set of subspaces of X, and show that every Banach space is either ergodic or contains a subspace with an unconditional basis which is complementably universal for the family of its block-subspaces. We also use our methods to get uniformity results. We show that an unconditional basis of a Banach space, of which every block-subspace is complemented, must be asymptotically c₀ or ?_p, and we deduce some new characterisations of the classical spaces c₀ and ?_p.     

Genericity and amalgamation of classes of Banach spaces

We study universality problems in Banach space theory. We show that if A is an analytic class, in the Effros-Borel structure of subspaces of C([0,1]), of non-universal separable Banach spaces, then there exists a non-universal separable Banach space Y, with a Schauder basis, that contains isomorphs of each member of A with the bounded approximation property. The proof is based on the amalgamation technique of a class C of separable Banach spaces, introduced in the paper. We show, among others, that there exists a separable Banach space R not containing L¹(0,1) such that the indices β and rND are unbounded on the set of Baire-1 elements of the ball of the double dual R∗∗ of R. This answers two questions of H.P. Rosenthal.We also introduce the concept of a strongly bounded class of separable Banach spaces. A class C of separable Banach spaces is strongly bounded if for every analytic subset A of C there exists Y∈C that contains all members of A up to isomorphism. We show that several natural classes of separable Banach spaces are strongly bounded, among them the class of non-universal spaces with a Schauder basis, the class of reflexive spaces with a Schauder basis, the class of spaces with a shrinking Schauder basis and the class of spaces with Schauder basis not containing a minimal Banach space X.     

Evidence and plausibility in neighborhood structures

The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an evidence logic for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a neighborhood semantics, where a neighborhood N indicates that the agent has reason to believe that the true state of the world lies in N. Further notions of relative plausibility between worlds and beliefs based on the latter ordering are then defined in terms of this evidence structure, yielding our intended models for evidence-based beliefs. In addition, we also consider a second more general flavor, where belief and plausibility are modeled using additional primitive relations, and we prove a representation theorem showing that each such general model is a p-morphic image of an intended one. This semantics invites a number of natural special cases, depending on how uniform we make the evidence sets, and how coherent their total structure. We give a structural study of the resulting ‘uniform’ and ‘flat’ models. Our main result are sound and complete axiomatizations for the logics of all four major model classes with respect to the modal language of evidence, belief and safe belief. We conclude with an outlook toward logics for the dynamics of changing evidence, and the resulting language extensions and connections with logics of plausibility change.     

Proof and refutation in MALL as a game

We present a setting in which the search for a proof of B or a refutation of B (i.e., a proof of ¬B) can be carried out simultaneously: in contrast, the usual approach in automated deduction views proving B or proving ¬B as two, possibly unrelated, activities. Our approach to proof and refutation is described as a two-player game in which each player follows the same rules. A winning strategy translates to a proof of the formula and a counter-winning strategy translates to a refutation of the formula. The game is described for multiplicative and additive linear logic (MALL). A game theoretic treatment of the multiplicative connectives is intricate and our approach to it involves two important ingredients. First, labeled graph structures are used to represent positions in a game and, second, the game playing must deal with the failure of a given player and with an appropriate resumption of play. This latter ingredient accounts for the fact that neither player might win (that is, neither B nor ¬B might be provable).     

Totality in arena games

We tackle the problem of preservation of totality by composition in arena games. We first explain how this problem reduces to a finiteness theorem on what we call pointer structures, similar to the parity pointer functions of Harmer, Hyland & Melliès and the interaction sequences of Coquand. We discuss how this theorem relates to normalization of linear head reduction in simply-typed λ-calculus, leading us to a semantic realizability proof à la Kleene of our theorem. We then present another proof of a more combinatorial nature. Finally, we discuss the exact class of strategies to which our theorems apply.     

Completeness for flat modal fixpoint logics

This paper exhibits a general and uniform method to prove axiomatic completeness for certain modal fixpoint logics. Given a set Γ of modal formulas of the form γ(x,p₁,…,p_n), where x occurs only positively in γ, we obtain the flat modal fixpoint language L_?(Γ) by adding to the language of polymodal logic a connective ?_γ for each γ∈Γ. The term ?_γ(φ₁,…,φ_n) is meant to be interpreted as the least fixed point of the functional interpretation of the term γ(x,φ₁,…,φ_n). We consider the following problem: given Γ, construct an axiom system which is sound and complete with respect to the concrete interpretation of the language L_?(Γ) on Kripke structures. We prove two results that solve this problem.First, let be the logic obtained from the basic polymodal by adding a Kozen-Park style fixpoint axiom and a least fixpoint rule, for each fixpoint connective ?_γ. Provided that each indexing formula γ satisfies a certain syntactic criterion, we prove this axiom system to be complete.Second, addressing the general case, we prove the soundness and completeness of an extension of . This extension is obtained via an effective procedure that, given an indexing formula γ as input, returns a finite set of axioms and derivation rules for ?_γ, of size bounded by the length of γ. Thus the axiom system is finite whenever Γ is finite.     

The logic of justified belief,explicit knowledge,and conclusive evidence

We present a complete, decidable logic for reasoning about a notion of completely trustworthy (“conclusive”) evidence and its relations to justifiable (implicit) belief and knowledge, as well as to their explicit justifications. This logic makes use of a number of evidence-related notions such as availability, admissibility, and “goodness” of a piece of evidence, and is based on an innovative modification of the Fitting semantics for Artemov?s Justification Logic designed to preempt Gettier-type counterexamples. We combine this with ideas from belief revision and awareness logics to provide an account for explicitly justified (defeasible) knowledge based on conclusive evidence that addresses the problem of (logical) omniscience.     

Positive provability logic for uniform reflection principles

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant ‘true’ by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform reflection schemata in arithmetic, possibly of unrestricted logical complexity. We formulate an arithmetically complete calculus with modalities labeled by natural numbers and ω, where ω   corresponds to the full uniform reflection schema, whereas n<ω$n<\omega$ corresponds to its restriction to arithmetical _Πn+1${\Pi }_{n+1}$-formulas. This calculus is shown to be complete w.r.t. a suitable class of finite Kripke models and to be decidable in polynomial time.     

Aglianò-Montagna type decomposition of linear pseudo hoops and its applications

We decompose every linear pseudo hoop as an Aglianò-Montagna type of ordinal sum of linear Wajsberg pseudo hoops which are either negative cones of linear ?-groups or intervals in linear unital ?-groups with strong unit. We apply the decomposition to present a new proof that every linear pseudo BL-algebra and consequently every representable pseudo BL-algebra is good. Moreover, we show that every maximal filter and every value of a linear pseudo hoop is normal, and every σ-complete linear pseudo hoop is commutative.     

Modules over quantaloids: Applications to the isomorphism problem in algebraic logic and π-institutions

We solve the isomorphism problem in the context of abstract algebraic logic and of π-institutions, namely the problem of when the notions of syntactic and semantic equivalence among logics coincide. The problem is solved in the general setting of categories of modules over quantaloids. We introduce closure operators on modules over quantaloids and their associated morphisms. We show that, up to isomorphism, epis are morphisms associated with closure operators. The notions of (semi-)interpretability and (semi-)representability are introduced and studied. We introduce cyclic modules, and provide a characterization for cyclic projective modules as those having a g-variable. Finally, we explain how every π-institution induces a module over a quantaloid, and thus the theory of modules over quantaloids can be considered as an abstraction of the theory of π-institutions.     

On the continuity of residuals of triangular norms

In this work a long-standing problem related to the continuity of R-implications, i.e., implications obtained as the residuum of t-norms, has been solved. A complete characterization of the class of continuous R-implications obtained from any arbitrary t-norm is given. In particular, it is shown that an R-implication I_T is continuous if and only if T is a nilpotent t-norm. Using this result, the exact intersection between the continuous subsets of R-implications and (S,N)-implications has been determined, by showing that the only continuous (S,N)-implication that is also an R-implication obtained from any t-norm, not necessarily left-continuous, is the ?ukasiewicz implication up to an isomorphism.     

Inclusion and exclusion dependencies in team semantics — On some logics of imperfect information

We introduce some new logics of imperfect information by adding atomic formulas corresponding to inclusion and exclusion dependencies to the language of first order logic. The properties of these logics and their relationships with other logics of imperfect information are then studied. As a corollary of these results, we characterize the expressive power of independence logic, thus answering an open problem posed in Grädel and Väänänen, 2010 [9].     

Algebraic proof theory for substructural logics: Cut-elimination and completions

We carry out a unified investigation of two prominent topics in proof theory and order algebra: cut-elimination and completion, in the setting of substructural logics and residuated lattices.We introduce the substructural hierarchy — a new classification of logical axioms (algebraic equations) over full Lambek calculus FL, and show that a stronger form of cut-elimination for extensions of FL and the MacNeille completion for subvarieties of pointed residuated lattices coincide up to the level N₂ in the hierarchy. Negative results, which indicate limitations of cut-elimination and the MacNeille completion, as well as of the expressive power of structural sequent calculus rules, are also provided.Our arguments interweave proof theory and algebra, leading to an integrated discipline which we call algebraic proof theory.     

A class of Banach spaces with few non-strictly singular operators

We construct a family (X_γ) of reflexive Banach spaces with long (countable as well as uncountable) transfinite bases but with no unconditional basic sequences. The method we introduce to achieve this allows us to considerably control the structure of subspaces of the resulting spaces as well as to precisely describe the corresponding spaces on non-strictly singular operators. For example, for every pair of countable ordinals γ,β, we are able to decompose every bounded linear operator from X_γ to X_β as the sum of a diagonal operator and an strictly singular operator. We also show that every finite-dimensional subspace of any member X_γ of our class can be moved by and (4+?)-isomorphism to essentially any region of any other member X_δ or our class. Finally, we find subspaces X of X_γ such that the operator space L(X,X_γ) is quite rich but any bounded operator T from X into X is a strictly singular pertubation of a scalar multiple of the identity.