English
Related papers

Related papers: Preconditionals

200 papers

We explain the motivation for looking for a predicative analogue of the notion of a topos and propose two definitions. For both notions of a predicative topos we will present the basic results, providing the groundwork for future work in…

Category Theory · Mathematics 2012-07-05 Benno van den Berg

We introduce isotonic conditional laws (ICL) which extend the classical notion of conditional laws by the additional requirement that there exists an isotonic relationship between the random variable of interest and the conditioning random…

Statistics Theory · Mathematics 2024-03-13 Sebastian Arnold , Johanna Ziegel

We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…

Logic · Mathematics 2024-11-28 A. L. Semenov , S. F. Soprunov

We extend the logical categories framework to first order modal logic. In our modal categories, modal operators are applied directly to subobjects and interact with the background factorization system. We prove a Joyal-style representation…

Logic in Computer Science · Computer Science 2025-04-07 Silvio Ghilardi , Jérémie Marquès

This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…

Logic · Mathematics 2026-02-17 Ulf Hlobil

It is proved that every prevariety of algebras is categorically equivalent to a "prevariety of logic", i.e., to the equivalent algebraic semantics of some sentential deductive system. This allows us to show that no nontrivial equation in…

Logic · Mathematics 2019-02-13 T. Moraschini , J. G. Raftery

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…

Artificial Intelligence · Computer Science 2020-12-22 Angelos Charalambidis , Giorgos Papadimitriou , Panos Rondogiannis , Antonis Troumpoukis

In this paper, we further develop the framework of Modular Systems that lays model-theoretic foundations for combining different declarative languages, agents and solvers. We introduce a multi-language logic of modular systems. We define…

Logic in Computer Science · Computer Science 2014-05-07 Shahab Tasharrofi , Eugenia Ternovska

The integration of lexical semantics and pragmatics in the analysis of the meaning of natural lan- guage has prompted changes to the global framework derived from Montague. In those works, the original lexicon, in which words were assigned…

Computation and Language · Computer Science 2013-09-05 Bruno Mery , Christian Retoré

We generalize intuitionistic tense logics to the multi-modal case by placing grammar logics on an intuitionistic footing. We provide axiomatizations for a class of base intuitionistic grammar logics as well as provide axiomatizations for…

Logic · Mathematics 2021-10-05 Tim S. Lyon

The relational data model requires a theory of relations in which tuples are not only many-sorted, but can also have indexes that are not necessarily numerical. In this paper we develop such a theory and define operations on relations that…

Databases · Computer Science 2012-02-08 Philip Kelly , M. H. van Emden

A semantic tableau method, called an argumentation tableau, that enables the derivation of arguments, is proposed. First, the derivation of arguments for standard propositional and predicate logic is addressed. Next, an extension that…

Artificial Intelligence · Computer Science 2022-09-13 Nico Roos

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

Category Theory · Mathematics 2024-12-31 Benedikt Ahrens , Peter LeFanu Lumsdaine , Paige Randall North

A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz…

Logic · Mathematics 2021-07-01 R. Jansana , T. Moraschini

Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…

Logic in Computer Science · Computer Science 2020-10-19 Satoshi Kura

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

In this paper, we use a categorical and functorial set up to model the syntax and inference of logics with algebraic signature, extending previous works on algebraisation of logics. The main feature of this work is that structurality, or…

Category Theory · Mathematics 2021-09-22 Lingyuan Ye

We propose a cognitively and linguistically motivated set of sorts for lexical semantics in a compositional setting: the classifiers in languages that do have such pronouns. These sorts are needed to include lexical considerations in a…

Computation and Language · Computer Science 2013-12-12 Bruno Mery , Christian Retoré

The Aristotelian syllogistic cannot account for the validity of many inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a)…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann , Lawrence S. Moss