We extend to the exponential connectives of linear logic the study initiated in Bucciarelli and Ehrhard 247). We define an indexed version of propositional linear logic and provide a sequent calculus for this system. To a formula A of indexed linear logic, we associate an underlying formula of linear logic, and a family A of elements of , the interpretation of in the category of sets and relations. Then A is provable in indexed linear logic iff the family A is (...) contained in the interpretation of some proof of . We extend to this setting the product phase semantics of indexed multiplicative additive linear logic introduced in Bucciarelli and Ehrhard , defining the symmetric product phase spaces. We prove a soundness result for this truth-value semantics and show how a denotational model of linear logic can be associated to any symmetric product phase space. Considering a particular symmetric product phase space, we obtain a new coherence space model of linear logic, which is non-uniform in the sense that the interpretation of a proof of !A−B contains informations about the behavior of this proof when applied to “chimeric” arguments of type A . In this coherence semantics, an element of a web can be strictly coherent with itself, or two distinct elements can be “neutral”. (shrink)

We study the notion of logical relation in the coherence space semantics of multiplicative-additive linear logic . We show that, when the ground-type logical relation is “closed under restrictions”, the logical relation associated to any type can be seen as a map associating facts of a phase space to families of points of the web of the corresponding coherence space. We introduce a sequent calculus extension of whose formulae denote these families of points. This logic admits a truth-value (...) semantics in the previously mentioned phase space, and this truth-value semantics faithfully describes the logical relation model we started from. Then we generalize this notion of phase space, we prove a truth-value completeness result for and we derive from any phase model of a denotational model for . Using the truth-value completeness result, we obtain a weak denotational completeness result based on this new denotational semantics. (shrink)

Wansing’s extended intuitionistic linear logic with strong negation, called WILL, is regarded as a resource-conscious refinment of Nelson’s constructive logics with strong negation. In this paper, (1) the completeness theorem with respect to phase semantics is proved for WILL using a method that simultaneously derives the cut-elimination theorem, (2) a simple correspondence between the class of Petri nets with inhibitor arcs and a fragment of WILL is obtained using a Kripke semantics, (3) a cut-free sequent calculus for (...) WILL, called twist calculus, is presented, (4) a strongly normalizable typed λ-calculus is obtained for a fragment of WILL, and (5) new applications of WILL in medical diagnosis and electric circuit theory are proposed. Strong negation in WILL is found to be expressible as a resource-conscious refutability, and is shown to correspond to inhibitor arcs in Petri net theory. (shrink)

This paper presents a polarized phase semantics, with respect to which the linear fragment of second order polarized linear logic of Laurent [15] is complete. This is done by adding a topological structure to Girard's phase semantics [9]. The topological structure results naturally from the categorical construction developed by Hamano—Scott [12]. The polarity shifting operator ↓ (resp. ↑) is interpreted as an interior (resp. closure) operator in such a manner that positive (resp. negative) formulas correspond to (...) open (resp. closed) facts. By accommodating the exponentials of linear logic, our model is extended to the polarized fragment of the second order linear logic. Strong forms of completeness theorems are given to yield cut-eliminations for the both second order systems. As an application of our semantics, the first order conservativity of linear logic is studied over its polarized fragment of Laurent [16]. Using a counter model construction, the extension of this conservativity is shown to fail into the second order, whose solution is posed as an open problem in [16]. After this negative result, a second order conservativity theorem is proved for an eta expanded fragment of the second order linear logic, which fragment retains a focalized sequent property of [3]. (shrink)

It is known that linear-time temporal logic is a useful logic for verifying and specifying concurrent systems. In this paper, phase semantics for LTL and its substructural refinements is introduced, and the completeness and cut-elimination theorems for LTL and its refinements are proved based on this semantics.

Girard introduced phase semantics as a complete set-theoretic semantics of linear logic, and Okada modified phase-semantic completeness proofs to obtain normal-form theorems. On the basis of these works, Okada and Takemura reformulated Girard’s phase semantics so that it became phase semantics for proof-terms, i.e., lambda-terms. They formulated phase semantics for proof-terms of Laird’s dual affine/intuitionistic lambda-calculus and proved the normal-form theorem for Laird’s calculus via a completeness theorem. Their semantics (...) was obtained by an application of computability predicates. In this paper, we first formulate phase semantics for proof-terms of second-order intuitionistic propositional logic by modifying Tait-Girard’s saturated sets method. Next, we prove the completeness theorem with respect to this semantics, which implies a strong normalization theorem. (shrink)

The category of coherent phase spaces introduced by the author is a refinement of the symplectic “category” of A. Weinstein. This category is *-autonomous and thus provides a denotational model for Multiplicative Linear Logic. Coherent phase spaces are symplectic manifolds equipped with a certain extra structure of “coherence”. They may be thought of as “infinitesimal” analogues of familiar coherent spaces of Linear Logic. The role of cliques is played by Lagrangian submanifolds of ambient spaces. Physically, a symplectic manifold (...) is the phase space of a classical dynamical system, and a Lagrangian submanifold is a phase of a short-wave oscillation. Typically, Lagrangian submanifolds represent such objects as short-wave approximations of wave functions in asymptotic quantization and wave fronts in geometrical optics. The coherent phase space semantics was motivated to a large extent by methods of geometric and asymptotic quantization and suggests some interesting intuitions on Linear Logic. In particular Lagrangian submanifold-cliques of types A and A can be interpreted as semiclassical limits of eigenstates of respectively position and momentum observables. These observables being canonically conjugate cannot be measured simultaneously, which corresponds to the idea that a formula A and its negation A cannot both simultaneously have proofs . We show that the coherent phase space semantics of Linear Logic enjoys several completeness properties in general much stronger than the usual full completeness with respect to the class of dinatural transformations. These properties of completeness in conjunction with a quite natural -physical meaning make the coherent phase space semantics an interesting object of investigation. (shrink)

Different conceptions of scientific theories, such as the state spaces approach of Bas van Fraassen, the phase spaces approach of Frederick Suppe, the set-theoretical approach of Patrick Suppes, and the structuralist view of Joseph Sneed et al. are usually put together into one big family. In addition, the definite article is normally used, and thus we speak of the semantic conception of theories and of its different approaches . However, in The Semantic Conception of Theories and Scientific Realism , (...) starting from certain remarks already made in “Theory Structure” , Current Research in Philosophy of Science, East Lansing: Philosophy of Science Association, 1979, pp. 317–338), Frederick Suppe excludes the structuralist view as well as other “European” versions from the semantic conception of theories. In this paper I will critically examine the reasons put forward by Suppe for this decision and, later, I will provide a general characterization of the semantic family and of the structuralist view of theories in such a way as to justify the inclusion of the structuralist view as a member of this family. (shrink)

Jerrold J. Katz often explained his semantic theory by way of an analogy with physical atomism and an attendant analogy with chemistry. In this chapter, I track the origin and uses of these analogies by Katz, both in explaining and defending his decompositional semantic theory, through the various phases of his work throughout his career.

This paper will deal with three questions regarding Carnap's transition from the position he held at the time of writing Syntax to the doctrines he held during his semantic phase: (1) What was Carnap's attitude towards truth at the time of writing Syntax? (2) What was Carnap's position regarding questions of reference and ontology at the time of writing Syntax? (3) Was Carnap's acceptance of Tarski's analysis of truth and reference detrimental to his philosophical project? Section 1 of this (...) paper will deal with the first of these questions. Special attention will be paid to identifying what it was that prevented Carnap from defining a truth predicate for descriptive languages in Syntax. Section 2 of this paper will deal with the question of Carnap's attitude towards reference and ontology in Syntax. It will be shown that the attempt in Syntax to address ontological questions is seriously defective. Section 3 of this paper addresses the last of the questions posed above. It is argued that in the light of what is established in Sections 1 and 2, Carnap could not have retained the position of Syntax with respect to truth and reference. (shrink)

Phase models for affine linear logic were independently devised by Lafont [10] and Piazza [15], although foreshadowed by Ono [14]. However, the existing semantics either contain no explicit directions for the construction of models in the general case, or else are forced to resort to additional conditions extending Girard's semantics. We dispense with these extra postulates - at least for the subexponential fragment of this logic - considering structures where the set of antiphases is concretely constructed. Moreover, (...) we show the equivalence of our phase models and the algebraic models of affine linear logic by means of a representation theorem. (shrink)

Linguistic choices have different attributions beyond their literal meaning according to their contexts. This paper looks at the variations in the discourses seen in the written colonial agreements and treaties during the Malabar conquest. The study employs the archived documents of various discourses during this period as a part of power shifting from the local elites to the colonial power. It explores how power is intertwined in the linguistic choices of different communication files. The study employs a hybrid methodology of (...) forensic linguistics and legal history. The analysis progresses in two phases: i) the linguistic attributions of power in the communications between the local elites and the colonial authorities and ii) the comparative analysis of variations in the linguistic choices by the colonial authorities correlating their varying power positions over the given period. It explores the dynamics of the linguistic choices of the local elites initially as a powerful entity in communication with the colonial authorities. The analysis shows a variation in the linguistic choices of the colonial authorities that suggests how they are used to reflect the power positions on a scale from weaker to powerful along the timeline. The paper argues that the linguistic choices of the colonial communication files aided them in projecting their power to society and assisted as one of the tools for reiterating their power position in various contexts. (shrink)

In the context of propositional logics, we apply semantics modulo satisfiability—a restricted semantics which comprehends only valuations that satisfy some specific set of formulas—with the aim to efficiently solve some computational tasks. Three possible such applications are developed.We begin by studying the possibility of implicitly representing rational McNaughton functions in Łukasiewicz Infinitely-valued Logic through semantics modulo satisfiability. We theoretically investigate some approaches to such representation concept, called representation modulo satisfiability, and describe a polynomial algorithm that builds representations (...) in the newly introduced system. An implementation of the algorithm, test results and ways to randomly generate rational McNaughton functions for testing are presented. Moreover, we propose an application of such representations to the formal verification of properties of neural networks by means of the reasoning framework of Łukasiewicz Infinitely-valued Logic.Then, we move to the investigation of the satisfiability of joint probabilistic assignments to formulas of Łukasiewicz Infinitely-valued Logic, which is known to be an NP-complete problem. We provide an exact decision algorithm derived from the combination of linear algebraic methods with semantics modulo satisfiability. Also, we provide an implementation for such algorithm for which the phenomenon of phase transition is empirically detected.Lastly, we study the game theory situation of observable games, which are games that are known to reach a Nash equilibrium, however, an external observer does not know what is the exact profile of actions that occur in a specific instance; thus, such observer assigns subjective probabilities to players actions. We study the decision problem of determining if a set of these probabilistic constraints is coherent by reducing it to the problems of satisfiability of probabilistic assignments to logical formulas both in Classical Propositional Logic and Łukasiewicz Infinitely-valued Logic depending on whether only pure equilibria or also mixed equilibria are allowed. Such reductions rely upon the properties of semantics modulo satisfiability. We provide complexity and algorithmic discussion for the coherence problem and, also, for the problem of computing maximal and minimal probabilistic constraints on actions that preserves coherence.prepared by Sandro Márcio da Silva Preto.E-mail: [email protected]:https://doi.org/10.11606/T.45.2021.tde-17062021-163257. (shrink)

In this paper we argue for an integrated inferential conception about theories and representations and its role in accounting for the theoretical value of philosophically disregarded representational practices, such as the systematic use of phase space diagrams within the theoretical context of statistical mechanics. This proposal would rely on both inferentialism about scientific representations (Suárez 2004) and inferentialism about particular physical theories (Wallace 2017). We defend that both perspectives somehow converge into an integrated inferentialism by means of the thesis (...) theories as being composed of representations, as defended from the representational semantic conception defended by Suárez and Pero (2019). (shrink)

The present study intended to investigate, first, the impact of semantic clustering on the recall and recognition of incidentally learned words in a new language, and second, how the interaction between semantic clustering and frequency of occurrence may modulate learning. To that end, Spanish university students watched an intentionally created video which contained Spanish target words that were either semantically related to others of the set, or not semantically linked at all. Furthermore, frequency of appearance changed among target words (1|4|8). (...) All these words were paired with pseudowords that appeared as on-screen text during the videos. Participants were completely naive to the phases and the procedure of the experiment. After viewing the video, participants completed a recall test and a recognition test. Results showed that words presented in semantically unrelated categories were better recalled and better recognized than those presented in semantic clusters, especially when the words were presented more often. (shrink)

A major challenge for semantic video segmentation is how to exploit the spatiotemporal information and produce consistent results for a video sequence. Many previous works utilize the precomputed optical flow to warp the feature maps across adjacent frames. However, the imprecise optical flow and the warping operation without any learnable parameters may not achieve accurate feature warping and only bring a slight improvement. In this paper, we propose a novel framework named Dynamic Warping Network to adaptively warp the interframe features (...) for improving the accuracy of warping-based models. Firstly, we design a flow refinement module to optimize the precomputed optical flow. Then, we propose a flow-guided convolution to achieve the adaptive feature warping based on the refined optical flow. Furthermore, we introduce the temporal consistency loss including the feature consistency loss and prediction consistency loss to explicitly supervise the warped features instead of simple feature propagation and fusion, which guarantees the temporal consistency of video segmentation. Note that our DWNet adopts extra constraints to improve the temporal consistency in the training phase, while no additional calculation and postprocessing are required during inference. Extensive experiments show that our DWNet can achieve consistent improvement over various strong baselines and achieves state-of-the-art accuracy on the Cityscapes and CamVid benchmark datasets. (shrink)

Quantification, Negation, and Focus: Challenges at the Conceptual-Intentional Semantic Interface Tista Bagchi National Institute of Science, Technology, and Development Studies (NISTADS) and the University of Delhi Since the proposal of Logical Form (LF) was put forward by Robert May in his 1977 MIT doctoral dissertation and was subsequently adopted into the overall architecture of language as conceived under Government-Binding Theory (Chomsky 1981), there has been a steady research effort to determine the nature of LF in language in light of structurally (...) diverse languages around the world, which has ultimately contributed to the reinterpretation of LF as a Conceptual-Intentional (C-I) interface level between the computational syntactic component of the faculty of language and one or more interpretive faculties of the human mind. While this has opened up further possibilities of research in phenomena such as quantifier scope and scope interactions between negation, quantification, and focus, it has also given rise to a few real challenges to linguistic theory as well. Some of these are: (i) the split between lexical meaning – a matter supposedly belonging to the phase-wise selection of lexical arrays – and issues of semantic interpretation that arise purely from binding and scope phenomena (Mukherji 2010); (ii) partially relatedly, the level at which theta role assignment can be argued to take place, an issue that is taken up by me in Bagchi (2007); and (iii) how supposedly “pure” scopal phenomena relating to quantifiers, negation, and emphasizing expressions such as only and even (comparable to, e.g., Urdu/Hindi hii and bhii, Bangla –i and –o) also have dimensions of both focus and discourse reference. While recognizing all of these challenges, this talk aims to highlight particularly challenge (iii), both in terms of scholarship in the past and for the rich prospects for research on languages of south Asia with the semantics of quantification, negation, and focus in view. The scholarship of the past that I seek to relate this issue to is where, parallel to (and largely independently of) the research on LF that had been happening, Barwise and Cooper were developing their influential view of noun phrases as generalized quantifiers, culminating in their key 1981 article “Generalized Quantifiers and Natural Language” while, independently, McCawley, in his 1981 book Everything that Linguists have Always Wanted to Know about Logic, established through argumentation that all noun phrases semantically behave like generalized quantified expressions (further elaborated by him in the second – 1994 – revised edition of his book). I seek to demonstrate, based on limited data analysis from selected languages of south Asia, that our current understanding of quantification, negation, and focus under the Minimalist view owes something significant to the two major, but now largely marginalized, works of scholarship, and that for the way forward it is essential to adopt a more formal-semantic approach as adopted by them and also by later works such as Denis Bouchard’s (1995) The Semantics of Syntax, Mats Rooth’s work on focus (e.g., Rooth 1996, “Focus” in Shalom Lappin’s Handbook of Contemporary Semantic Theory), Heim and Kratzer’s Semantics in Generative Grammar (1998), and Yoad Winter’s (2002) Linguistic Inquiry article on semantic number, to cite just a few instances. (shrink)

Recent studies have shown that schizophrenia may be a disease affecting the states of consciousness. The present study is aimed at investigating metamemory, i.e., the knowledge about one's own memory capabilities, in patients with schizophrenia. The accuracy of the Confidence level (CL) in the correctness of the answers provided during a recall phase, and the predictability of the Feeling of Knowing (FOK) when recall fails were measured using a task consisting of general information questions and assessing semantic memory. Nineteen (...) outpatients were paired with 19 control subjects with respect to age, sex, and education. Results showed that patients with schizophrenia exhibited an impaired semantic memory. CL ratings as well as CL and FOK accuracy were not significantly different in the schizophrenic and the control groups. However, FOK ratings were significantly reduced for the patient group, and discordant FOK judgments were also observed more frequently. Such results suggest that FOK judgments are impaired in patients with schizophrenia, which confirms that schizophrenia is an illness characterized by an impaired conscious awareness of one's own knowledge. (shrink)

In the last two decades, Davidson’s event-argument hypothesis has become very popular in natural language semantics. This article questions that event-based analyses actually add something to our understanding of the respective phenomena: I argue that they already find their explanation in independently motivated grammatical assumptions and principles which apply to all kinds of modification. Apart from a short discussion of Davidson’s original arguments in favour of his hypothesis, I address Larson’s event-based account of the distinctions between stage-level vs. individual-level (...) modification and adverbial vs. adjectival modification in the nominal domain. I argue that his analysis of the former reduces straightforwardly to the grammatical structure of the nominal phase. As for the latter, I provide reasons which motivate a re-description of the phenomenon in terms of sensitivity to descriptive content rather than events. I argue that, so described, the phenomenon can be explained in terms of interface conditions, given a phasal architecture of grammar. (shrink)

In a previous work with Antonio Bucciarelli, we introduced indexed linear logic as a tool for studying and enlarging the denotational semantics of linear logic. In particular, we showed how to define new denotational models of linear logic using symmetric product phase models of indexed linear logic. We present here a strict extension of indexed linear logic for which symmetric product phase spaces provide a complete semantics. We study the connection between this new system and indexed (...) linear logic. (shrink)

The grammatical constraints on anaphoric binding, known as binding principles, are observed to form a classical square of oppositions. These constraints are then analysed as the effect of phase quantifiers over reference markers in grammatical obliqueness hierarchies, and the resulting phase quantifiers are shown to be organised in a square of logical duality. The impact of this result on the distinction between quantificational and referential nominals as well as on the logical foundations of the semantics of nominals (...) in general is discussed. (shrink)

There is a rich literature about the temporal conjunctions before/after, but at the time I gave the talk that underlies this paper I was not aware of any analysis of the temporal comparatives früher/später ‘earlier/later’, which may be used to express similar states of affairs, but are constructed differently.2 Recently I got acquainted with the del Prete’s thesis about It. prima/dopo, which analyses prima as a comparative and dopo as a preposition.3 This is the only paper known to me that (...) goes into the same direction as the following proposal. Del Prete’s analysis is very different from mine and I must leave the discussion of his theory to another occasion. The semantics of before/after is notoriously controversial and the semantics of the related adjectives is therefore interesting in itself. A study of the adjectives gains additional interest from the fact that they are entirely differently constructed: they are degree adjectives and have a comparative, an equative and a positive variant. I will study each of them. (shrink)

In this paper I offer an explanation for the fact that QR tends to be more local than other types of A-bar movement (i.e., in typical cases, QR cannot take place out of a finite clause). My explanation assumes (and offers evidence for) the Phase Impenetrability Condition (cf. Chomsky 2001a, b) and an Economy Condition that requires that each step of (possibly successive cyclic) QR be motivated (cf. Fox 1999). After showing why QR is local in typical cases, I (...) consider new evidence, involving a counterpart of ACD in Italian, which indicates that QR takes place long distance, as other types of A-bar movement do, whenever each step is independently motivated. It follows that it can be maintained that the locality conditions on QR are not construction specific, as expected given the general format of the theory. (shrink)

In this paper we ask whether approximation for abstract argumentation is useful in practice, and in particular whether reasoning with grounded semantics – which has polynomial runtime – is already an approximation approach sufficient for several practical purposes. While it is clear from theoretical results that reasoning with grounded semantics is different from, for example, skeptical reasoning with preferred semantics, we investigate how significant this difference is in actual argumentation frameworks. As it turns out, in many graphs (...) models, reasoning with grounded semantics actually approximates reasoning with other semantics almost perfectly. An algorithm for grounded reasoning is thus a conceptually simple approximation algorithm that not only does not need a learning phase – like recent approaches – but also approximates well – in practice – several decision problems associated to other semantics. (shrink)