Structurally free logic LC was introduced in [4]. A natural extension of LC, in particular, in a sequent formulation, is by conjunction and disjunction that do not distribute over each other. We define a set theoretical semantics for these logics via constructing a representation of a lattice that we extend by intensional operations. Canonically, minimally overlapping filter-ideal pairs are used; this construction avoids the use of an equivalent of the axiom of choice and lends transparency to the (...) structure. We also discuss adapting the present semantics for substructural logics, as well as, the question of cannnonicity of LC+. (shrink)

The paper considers certain extensions of the system LC introduced in Dunn & Meyer 1997. LC is a structurally free system , but it has combinators as formulas in the place of structural rules. We consider two ways to extend LC with conjunction and disjunction depending on whether they distribute over each other or not. We prove the elimination theorem for the systems. At the end of the paper we give a Routley-Meyer style semantics for the distributive extension, (...) including some new definitions and an algorithm which are used in proving a representation theorem in general, i.e., for arbitrary combinators. (shrink)

A 'Kripke-style' semantics is given for combinatory logic using frames with a ternary accessibility relation, much as in the Tourley-Meyer semantics for relevance logic. We prove by algebraic means a completeness theorem for combinatory logic, by proving a representation theorem for 'combinatory posets.' A philosophical interpretation is given of the models, showing that an element of a combinatory poset can be understood simultaneously as a set of states and as a set of actions on states. This double interpretation allows for (...) one such element to be applied to another . Application turns out to be modeled the same way as 'fusion' in relevance logic.We also introduce 'dual combinators' that apply from the right. We then explore relationships to some well-known substructural logics, showing that each can be embedded into the structurally free. non-associative Lambek calculus, with the embedding taking a theorem ω to a statement of the form Γ ⊨ ω, where Γ is some fusion of the combinators needed to justify the structural assumptions of the given substructural logic. This builds on earlier ideas from Belnap and Meyer about a Gentzen system wherein structural rules are replaced with rules for introducing combinators. We develop such a system and prove a cut theorem. (shrink)

Free logics are a family of first-order logics which came about as a result of examining the existence assumptions of classical logic (Hintikka _The Journal of Philosophy_, _56_, 125–137 1959 ; Lambert _Notre Dame Journal of Formal Logic_, _8_, 133–144 1967, 1997, 2001 ). What those assumptions are varies, but the central ones are that (i) the domain of interpretation is not empty, (ii) every name denotes exactly one object in the domain and (iii) the quantifiers have (...) existential import. Free logics reject the claim that names need to denote in (ii). _Positive_ free logic concedes that some atomic formulas containing non-denoting names (including self-identity) are true, _negative_ free logic treats them as uniformly false, and _neutral_ free logic as taking a third value. There has been a renewed interest in analyzing proof theory of free logic in recent years, based on intuitionistic logic in Maffezioli and Orlandelli (_Bulletin of the Section of Logic_, _48_(2), 137–158 2019 ) as well as classical logic in Pavlović and Gratzl (_Journal of Philosophical Logic_, _50_, 117–148 2021 ), there for the positive and negative variants. While the latter streamlines the presentation of free logics and offers a more unified approach to the variants under consideration, it does not cover neutral free logic, since there is some lack of both clear formal intuitions on the semantic status of formulas with empty names, as well as a satisfying account of the conditional in this context. We discuss extending the results to this third major variant of free logics. We present a series of G3 sequent calculi adapted from Fjellstad (_Studia Logica_, _105_(1), 93–119 2017, _Journal of Applied Non-Classical Logics_, _30_(3), 272–289 2020 ), which possess all the desired structural properties of a good proof system, including admissibility of contraction and all versions of the cut rule. At the same time, we maintain the unified approach to free logics and moreover argue that greater clarity of intuitions is achieved once neutral free logic is conceptualized as consisting of two sub-varieties. (shrink)

The search for the extensions of sentences can be guided by Frege’s “principle of compositionality of extension”, according to which the extension of a composed expression depends only on its logical form and the extensions of its parts capable of having extensions. By means of this principle, a strict criterion for the admissibility of objects as extensions of sentences can be derived: every object is admissible as the extension of a sentence that is preserved under the substitution of co-extensional expressions. (...) The question is: what are the extensions of elementary sentences containing empty singular terms, like ‘Vulcan rotates’. It can be demonstrated that in such sentences, states of affairs as structured objects (but not truth-values) are preserved under the substitution of co-extensional expressions. Hence, such states of affairs are admissible (while truth-values are not) as extensions of elementary sentences containing empty singular terms. (shrink)

The partial structures approach has two major components: a broad notion of structure (partial structure) and a weak notion of truth (quasi-truth). In this paper, we discuss the relationship between this approach and free logic. We also compare the model-theoretic analysis supplied by partial structures with the method of supervaluations, which was initially introduced as a technique to provide a semantic analysis of free logic. We then combine the three formal frameworks (partial structures, free logic and supervaluations), (...) and apply the resulting approach to accommodate semantic paradoxes. (shrink)

The three essays presented here concern natural connections between grammatical derivations and structures provided by certain standard grammar formalisms, on the one hand, and deductions in logical systems, on the other hand. In the first essay we analyse the adequacy of Polish notation for higher-order languages. The Ajdukiewicz algorithm (Ajdukiewicz 1935) is discussed in terms of generalized MP-deductions. We exhibit a failure in Ajdukiewicz’s original version of the algorithm and give a correct one; we prove that generalized MP-deductions have the (...) frontier property, which is essential for the plausibility of Polish notation. The second essay deals with logical systems corresponding to different grammar formalisms, as e.g. Finite State Acceptors, Context-Free Grammars, Categorial Grammars, and others. We show how can logical methods be used to establish certain linguistically significant properties of formal grammars. The third essay discusses the interplay between Natural Deduction proofs in grammar oriented logics and semantic structures expressible by typed lambda terms and combinators. (shrink)

Free logics is a family of first-order logics which came about as a result of examining the existence assumptions of classical logic. What those assumptions are varies, but the central ones are that the domain of interpretation is not empty, every name denotes exactly one object in the domain and the quantifiers have existential import. Free logics usually reject the claim that names need to denote in, and of the systems considered in this paper, the (...) positive free logic concedes that some atomic formulas containing non-denoting names are true, while negative free logic rejects even the latter claim. Inclusive logics, which reject, are likewise considered. These logics have complex and varied axiomatizations and semantics, and the goal of this paper is to present an orderly examination of the various systems and their mutual relations. This is done by first offering a formalization, using sequent calculi which possess all the desired structural properties of a good proof system, including admissibility of contraction and cut, while streamlining free logics in a way no other approach has. We then present a simple and unified system of abstract semantics, which allows for a straightforward demonstration of the meta-theoretical properties, and offers insights into the relationship between different logics. The final part of this paper is dedicated to extending the system with modalities by using a labeled sequent calculus, and here we are again able to map out the different approaches and their mutual relations using the same framework. (shrink)

We investigate a recent proposal for modal hypersequent calculi. The interpretation of relational hypersequents incorporates an accessibility relation along the hypersequent. These systems give the same interpretation of hypersequents as Lellman's linear nested sequents, but were developed independently by Restall for S5 and extended to other normal modal logics by Parisi. The resulting systems obey Došen's principle: the modal rules are the same across different modal logics. Different modal systems only differ in the presence or absence of external (...) structural rules. With the exception of S5, the systems are modular in the sense that different structural rules capture different properties of the accessibility relation. We provide the first direct semantical cut-free completeness proofs for K, T, and D, and show how this method fails in the case of B and S4. (shrink)

In this paper, we present a modality-free pre-rough algebra. Łukasiewicz Moisil algebra and Wajsberg algebra are equivalent under a transformation. A similar type of equivalence exists in our proposed definition and standard definition of pre-rough algebra. We obtain a few modality-free algebras weaker than pre-rough algebra. Furthermore, it is also established that modality-free versions for other analogous structures weaker than pre-rough algebra do not exist. Both Hilbert-type axiomatization and sequent calculi for all proposed algebras are presented.

This book deals with an old conundrum: if God knows what we will choose tomorrow, how can we be free to choose otherwise? If all our choices are already written, is our freedom simply an illusion? This book provides a precise analysis of this dilemma using the tools of modern ontology and the logic of time. With a focus on three intertwined concepts - God's nature, the formal structure of time, and the metaphysics of time, including the relationship between (...) temporal entities and a timeless God - the chapters analyse various solutions to the problem of foreknowledge and freedom, revealing the advantages and drawbacks of each. Building on this analysis, the authors advance constructive solutions, showing under what conditions an entity can be omniscient in the presence of free agents, and whether an eternal entity can know the tensed futures of the world. The metaphysics of time, its topology and the semantics of future tensed sentences are shown to be invaluable topics in dealing with this issue. Combining investigations into the metaphysics of time with the discipline of temporal Logic this monograph brings about important advancements in the philosophical understanding of an ancient and fascinating problem. The answer, if any, is hidden in the folds of time, in the elusive nature of this feature of reality and in the infinite branching of our lives. (shrink)

. The paper presents a method for transforming a given sound and complete n-sequent proof system into an equivalent sound and complete system of ordinary sequents. The method is applicable to a large, central class of (generalized) finite-valued logics with the language satisfying a certain minimal expressiveness condition. The expressiveness condition decrees that the truth-value of any formula φ must be identifiable by determining whether certain formulas uniformly constructed from φ have designated values or not. The transformation preserves the (...) general structure of proofs in the original calculus in a way ensuring preservation of the weak cut elimination theorem under the transformation. The described transformation metod is illustrated on several concrete examples of many-valued logics, including a new application to information sources logics. (shrink)

We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calculus G4ip for intuitionistic propositional logic and for a corresponding multi-succedent calculus: this proof extends easily in the presence of quantifiers, in contrast to other, indirect, proofs. i.e., those which use induction on sequent weight or appeal to admissibility of rules in other calculi.

We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calculus G4ip for intuitionistic propositional logic and for a corresponding multi-succedent calculus: this proof extends easily in the presence of quantifiers, in contrast to other, indirect, proofs. i.e., those which use induction on sequent weight or appeal to admissibility of rules in other calculi.

The problem of algorithmic structuring of proofs in the sequent calculi LK and LKB ( LK where blocks of quantifiers can be introduced in one step) is investigated, where a distinction is made between linear proofs and proofs in tree form. In this framework, structuring coincides with the introduction of cuts into a proof. The algorithmic solvability of this problem can be reduced to the question of k-l-compressibility: "Given a proof of length k , and l ≤ k : Is (...) there is a proof of length ≤ l ?" When restricted to proofs with universal or existential cuts, this problem is shown to be (1) undecidable for linear or tree-like LK-proofs (corresponds to the undecidability of second order unification), (2) undecidable for linear LKB-proofs (corresponds to the undecidability of semi-unification), and (3) decidable for tree-like LKB -proofs (corresponds to a decidable subprob- lem of semi-unification). (shrink)

It has been common in contemporary philosophical logic to separate existence, essence and logic. I would like to reverse these separative tendencies. Doing so yields two theses, one about the existential basis of truth, the other about the essentialist basis of logic. The first thesis counters the common claim that both logical and essential truths-in short, structural truths-are existence-free. It is proposed that only real existences can generate essentialist and logical predications. The second thesis counters the common assumption that (...) logic is free of essentialist involvement. I propose the contrary-logical predications are to be explained as a special kind of essentialist attributions. (shrink)

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int, which Wansing presents in [2016a]. There he also gives a natural deduction system for this logic, N2Int, to which SC2Int is equivalent in terms of what is derivable. What is important is that these calculi represent a kind of bilateralist reasoning, since they (...) do not only internalize processes of verifcation or provability but also the dual processes in terms of falsifcation or what is called dual provability. In [Wansing, 2017] a normal form theorem for N2Int is stated, here, I want to prove a cut-elimination theorem for SC2Int, i.e., if successful, this would extend the results existing so far. (shrink)

In this paper, constructions of free ordered algebras on one generator are given that correspond to some one-variable fragments of affine propositional classical logic and their extensions with n-contraction (n ≥ 2). Moreover, embeddings of the already known infinite free structures into the algebras introduced below are furnished with; thus, solving along the respective cardinality problems.

In this paper, constructions of free ordered algebras on one generator are given that correspond to some one-variable fragments of affine propositional classical logic and their extensions with n-contraction. Moreover, embeddings of the already known infinite free structures into the algebras introduced below are furnished with; thus, solving along the respective cardinality problems.

Structural realists contend that the properties and relations in the world are more fundamental than the individuals. However, the standard model theory used to analyse the structure of logical theories can make it difficult to see how such an idea could be coherent or workable: for in that theory, properties and relations are constructed as sets of individuals. In this paper, I look at three ways in which structuralists might hope for an alternative: by appealing to predicate-functor logic, Tractarian geometry, (...) or cylindric algebras. I argue that the first two are problematic, but that the third is promising. (shrink)

In this paper an algebraic version for temporal algebras of the logical filtrations for modal and temporal logics is analysed. A structure theorem for free temporal algebras and also some results with regard to the variety of temporal algebras are obtained.

We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm , Tstit and Xstit. All calculi presented possess essential structural properties such as contraction- and cut-admissibility. The labelled calculi G3Ldm and G3Tstit are shown sound and complete relative to irreflexive temporal frames. Additionally, we extend current results by showing that also Xstit can be characterized through relational frames, omitting the use of BT+AC (...) frames. (shrink)

The two-dimensional modal logic of Davies and Humberstone [3] is an important aid to our understanding the relationship between actuality, necessity and a priori knowability. I show how a cut-free hypersequent calculus for 2D modal logic not only captures the logic precisely, but may be used to address issues in the epistemology and metaphysics of our modal concepts. I will explain how the use of our concepts motivates the inference rules of the sequent calculus, and then show that the (...) completeness of the calculus for Davies–Humberstone models explains why those concepts have the structure described by those models. The result is yet another application of the completeness theorem. (shrink)

Different natural deduction proof systems for intuitionistic and classical logic —and related logical systems—differ in fundamental properties while sharing significant family resemblances. These differences become quite stark when it comes to the structural rules of contraction and weakening. In this paper, I show how Gentzen and Jaśkowski’s natural deduction systems differ in fine structure. I also motivate directed proof nets as another natural deduction system which shares some of the design features of Genzen and Jaśkowski’s systems, but which differs again (...) in its treatment of the structural rules, and has a range of virtues absent from traditional natural deduction systems. (shrink)

In this paper we study natural deduction for the intuitionistic and classical (normal) modal logics obtained from the combinations of the axioms T, B, 4 and 5. In this context we introduce a new multi-contextual structure, called T-sequent, that allows to design simple labelfree natural deduction systems for these logics. After proving that they are sound and complete we show that they satisfy the normalization property and consequently the subformula property in the intuitionistic case.

In this report I motivate and develop a type-free logic with predicate quantifiers within the general ontological framework of properties, relations, and propositions. In Part I, I present the major ideas of the system informally and discuss its philosophical significance, especially with regard to Russell's paradox. In Part II, I prove the soundness, consistency, and completeness of the logic.

Any arbitrarily complicated non-oriented graph, that is a graph of arbitrarily large genus, can be encoded in a cut-free proof. This unpublished result of Statman was shown in the early seventies. We provide a proof of it, and of a number of other related facts.

We prove that each ∀1 free amalgamation class K over a finite relational language L admits a countable generic structure M isometrically embedding all countable structuresin K relative to a fixed metric. We expand L by infinitely many binary predicates expressingdistance, and prove that the resulting expansion of K has a model companion axiomatizedby the first-order theory of M. The model companion is non-finitely axiomatizable, evenover a strong form of the axiom scheme of infinity.

The fungal cell wall is a dynamic structure that protects the cell from changes in osmotic pressure and other environmental stresses, while allowing the fungal cell to interact with its environment. The structure and biosynthesis of a fungal cell wall is unique to the fungi, and is therefore an excellent target for the development of anti‐fungal drugs. The structure of the fungal cell wall and the drugs that target its biosynthesis are reviewed. Based on studies in a number of fungi, (...) the cell wall has been shown to be primarily composed of chitin, glucans, mannans and glycoproteins. The biosynthesis of the various components of the fungal cell wall and the importance of the components in the formation of a functional cell wall, as revealed through mutational analyses, are discussed. There is strong evidence that the chitin, glucans and glycoproteins are covalently cross‐linked together and that the cross‐linking is a dynamic process that occurs extracellularly. BioEssays 28: 799–808, 2006. © 2006 Wiley Periodicals, Inc. (shrink)

We characterise the intermediate logics which admit a cut-free hypersequent calculus of the form \, where \ is the hypersequent counterpart of the sequent calculus \ for propositional intuitionistic logic, and \ is a set of so-called structural hypersequent rules, i.e., rules not involving any logical connectives. The characterisation of this class of intermediate logics is presented both in terms of the algebraic and the relational semantics for intermediate logics. We discuss various—positive as well as negative—consequences (...) of this characterisation. (shrink)

The aim of UK-REACH (“The United Kingdom Research study into Ethnicity And COVID-19 outcomes in Healthcare workers”) is to understand if, how, and why healthcare workers (HCWs) in the United Kingdom (UK) from ethnic minority groups are at increased risk of poor outcomes from COVID-19. In this article, we present findings from the ethical and legal stream of the study, which undertook qualitative research seeking to understand and address legal, ethical, and social acceptability issues around data protection, privacy, and information (...) governance associated with the linkage of HCWs’ registration data and healthcare data. We interviewed 22 key opinion leaders in healthcare and health research from across the UK in two-to-one semi-structured interviews. Transcripts were coded using qualitative thematic analysis. Participants told us that a significant aspect of Big Data research in public health is varying drivers of mistrust—of the research itself, research staff and funders, and broader concerns of mistrust within participant communities, particularly in the context of COVID-19 and those situated in more marginalised community settings. However, despite the challenges, participants also identified ways in which legally compliant and ethically informed approaches to research can be crafted to mitigate or overcome mistrust and establish greater confidence in Big Data public health research. Overall, our research indicates that a “Big Data Ethics by Design” approach to research in this area can help assure (1) that meaningful community and participant engagement is taking place and that extant challenges are addressed, and (2) that any new challenges or hitherto unknown unknowns can be rapidly and properly considered to ensure potential (but material) harms are identified and minimised where necessary. Our findings indicate such an approach, in turn, will help drive better scientific breakthroughs that translate into medical innovations and effective public health interventions, which benefit the publics studied, including those who are often marginalised in research. (shrink)

We describe a method for obtaining classical logic from intuitionistic logic which does not depend on any proof system, and show that by applying it to the most important implicational relevance logics we get relevance logics with nice semantical and proof-theoretical properties. Semantically all these logics are sound and strongly complete relative to classes of structures in which all elements except one are designated. Proof-theoretically they correspond to cut-free hypersequential Gentzen-type calculi. Another major property of all (...) these logic is that the classical implication can faithfully be translated into them. (shrink)

We consider the notion of bounded m-ary patch-width defined in [9], and its very close relative m-constructibility defined below. We show that the notions of m-constructibility all coincide for m ≥ 3, while 1-constructibility is a weaker notion. The same holds for bounded m-ary patch-width. The case m = 2 is left open.

In this paper, the notion of structural completeness is explored in the context of a generalized class of superintuitionistic logics involving also systems that are not closed under uniform substitution. We just require that each logic must be closed under D-substitutions assigning to atomic formulas only ∨\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vee $$\end{document}-free formulas. For these systems we introduce four different notions of structural completeness and study how they are related. We focus on superintuitionistic (...) inquisitive logics that validate a schema called Split and have the disjunction property. In these logics disjunction can be interpreted in the sense of inquisitive semantics as a question forming operator. It is shown that a logic is structurally complete with respect to D-substitutions if and only if it includes the weakest superintuitionistic inquisitive logic. Various consequences of this result are explored. For example, it is shown that every superintuitionistic inquisitive logic can be characterized by a Kripke model built up from D-substitutions. Additionally, we resolve a conjecture concerning superintuitionistic inquisitive logics due to Miglioli et al.. (shrink)

We describe a method for obtaining classical logic from intuitionistic logic which does not depend on any proof system, and show that by applying it to the most important implicational relevance logics we get relevance logics with nice semantical and proof-theoretical properties. Semantically all these logics are sound and strongly complete relative to classes of structures in which all elements except one are designated. Proof-theoretically they correspond to cut-free hypersequential Gentzen-type calculi. Another major property of all (...) these logics is that the classical implication can faithfully be translated into them. (shrink)

The contraction-free sequent calculus G4 for intuitionistic logic is extended by rules following a general rule-scheme for nonlogical axioms. Admissibility of structural rules for these extensions is proved in a direct way by induction on derivations. This method permits the representation of various applied logics as complete, contraction- and cut-free sequent calculus systems with some restrictions on the nature of the derivations. As specific examples, intuitionistic theories of apartness and order are treated.

Unifiability of terms (and formulas) and structural completeness in the variety of relation algebras RA and in the products of modal logic S5 is investigated. Nonunifiable terms (formulas) which are satisfiable in varieties (in logics) are exhibited. Consequently, RA and products of S5 as well as representable diagonal-free n-dimensional cylindric algebras, RDfn, are almost structurally complete but not structurally complete. In case of S5n a basis for admissible rules and the form of all passive rules are (...) provided. (shrink)

The article presents proofs of the context freeness of a family of typelogical grammars, namely all grammars that are based on a uni- ormultimodal logic of pure residuation, possibly enriched with thestructural rules of Permutation and Expansion for binary modes.

This paper investigates the key drivers behind the origins of value-for-money (VFM) audit in Canada and the aims, intents, and logics ascribed by the original proponents. Drawing on insights from governmentality and New Public Management, the paper utilizes analysis methods adapted from case study research to review a wide range of primary documentation (e.g., Hansards from the Public Accounts Committee, House of Commons debates, the so-called Wilson report and the FMCS study) and secondary documentation (newspaper articles, Office of the (...) Auditor General internal publications, journal articles). Major findings indicate a rise of a management consulting culture within the Auditor General’s office following the appointment of James Johnson Macdonell. VFM legislation effectively operationalized practices drawn from management consulting expertise by invitation of the consultant. It was offered as an answer to the growing scope and size of government, which had become problematized by the Auditor General in terms of parliament losing control over the public purse. The Auditor General’s invocation of financial crisis led to a substantial broadening of mandate and increase in resources for that office. (shrink)

In a recent discussion article in this journal, Gila Sher responds to some of my criticisms of her work on what she calls the formal-structural account of logical consequence. In the present paper I reply and attempt to advance the discussion in a constructive way. Unfortunately, Sher seems to have not fully understood my 1997. Several of the defenses she mounts in her 2001 are aimed at views I do not hold and did not advance in my 1997. Most prominent (...) among these are her claims that I reject the formal-structural account, because it licenses “unnatural” logical constants, and that I consider the “truth-functional criterion” for connectives “a paradigm of a successful criterion of logicality”. Both of these claims are simply false, as even a moderately careful reading of my 1997 will show. Other charges she makes have some basis in fact but are inaccurate. For example, she says that I claim that FS is “neutral with regard to the apriority of logic,” and that this neutrality “renders it inconsistent”. What I actually say is that Sher’s acceptance of the neutrality in question is “inconsistent with part of the legacy of Tarski, a legacy that she finds very congenial”, not that FS itself is inconsistent. More interestingly, she misunderstands my claim about the apriority of logic, and clarification of this misunderstanding suggests two distinct ways in which logic might be held to be free of empirical influence. It is also noteworthy that Sher’s statements about the apriority of logic constitute both a change in the position she took in her 1991 and, although she seems not to realize it, an admission that she does not take issue with one of my major criticisms. (shrink)

In a recent discussion article in this journal, Gila Sher responds to some of my criticisms of her work on what she calls the formal-structural account of logical consequence. In the present paper I reply and attempt to advance the discussion in a constructive way. Unfortunately, Sher seems to have not fully understood my 1997. Several of the defenses she mounts in her 2001 are aimed at views I do not hold and did not advance in my 1997. Most prominent (...) among these are her claims that I reject the formal-structural account, because it licenses “unnatural” logical constants, and that I consider the “truth-functional criterion” for connectives “a paradigm of a successful criterion of logicality”. Both of these claims are simply false, as even a moderately careful reading of my 1997 will show. Other charges she makes have some basis in fact but are inaccurate. For example, she says that I claim that FS is “neutral with regard to the apriority of logic,” and that this neutrality “renders it inconsistent”. What I actually say is that Sher’s acceptance of the neutrality in question is “inconsistent with part of the legacy of Tarski, a legacy that she finds very congenial”, not that FS itself is inconsistent. More interestingly, she misunderstands my claim about the apriority of logic, and clarification of this misunderstanding suggests two distinct ways in which logic might be held to be free of empirical influence. It is also noteworthy that Sher’s statements about the apriority of logic constitute both a change in the position she took in her 1991 and, although she seems not to realize it, an admission that she does not take issue with one of my major criticisms. (shrink)

Konolige''s technical notion of belief based on deduction structures is briefly reviewed and its usefulness for the design of artificial agents with limited representational and deductive capacities is pointed out. The design of artificial agents with more sophisticated representational and deductive capacities is then taken into account. Extended representational capacities require in the first place a solution to the intensional context problems. As an alternative to Konolige''s modal first-order language, an approach based on type-free property theory is proposed. It (...) considers often neglected issues, such as the need for a more general account of thede dicto-de re distinction, and quasi-indicators. Extended deductive capacities require a subdivision of Konolige''s notion of belief into two distinct technical notions,potential anddispositional belief. The former has to do with what an artificial agent could in principle come to actively believe, given enough time and its specific logical competence; the latter with what an agent can be assumed to believe with respect to a specific goal to be fulfilled. (shrink)

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with formal (...) grammars, and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)