English
Related papers

Related papers: On prevarieties of logic

200 papers

In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…

Logic in Computer Science · Computer Science 2019-05-15 Marcelo Finger

The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work…

Logic · Mathematics 2026-03-24 Giuliano Rosella , Sara Ugolini

In a recent work we have shown how to construct an information algebra of coherent sets of gambles defined on general possibility spaces. Here we analyze the connection of such an algebra with the set algebra of subsets of the possibility…

Logic in Computer Science · Computer Science 2021-05-28 Juerg Kohlas , Arianna Casanova , Marco Zaffalon

The main objective of this paper is to show that the notion of type which was developed within the frames of logic and model theory has deep ties with geometric properties of algebras. These ties go back and forth from universal algebraic…

Logic · Mathematics 2011-08-03 Boris Plotkin , Elena Aladova , Eugene Plotkin

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

Logic · Mathematics 2023-11-08 Robert Goldblatt

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

Logic in Computer Science · Computer Science 2024-04-05 Michael Benedikt , Egor V. Kostylev , Tony Tan

Category theory can be used to state formulas in First-Order Logic without using set membership. Several notable results in logic such as proof of the continuum hypothesis can be elegantly rewritten in category theory. We propose in this…

Logic in Computer Science · Computer Science 2022-04-19 Chan Le Duc

We show that for quasivarieties of p-algebras the properties of (i) having decidable first-order theory and (ii) having decidable first-order theory of the finite members, coincide. The only two quasivarieties with these properties are the…

Logic · Mathematics 2024-09-16 Tomasz Kowalski , Katarzyna Słomczyńska

We prove that every many-sorted $\omega$-categorical theory is completely interpretable in a one-sorted $\omega$-categorical theory. As an application, we give a short proof of the existence of non $G$--compact $\omega$-categorical…

Logic · Mathematics 2011-03-21 Enrique Casanovas , Rodrigo Peláez , Martin Ziegler

It is known that a category of many-sorted algebras on pure sets of similarity type is "concretely equivalent" to a category of single-sorted algebras. In this paper, we characterize a single-sorted variety that corresponds to a many-sorted…

Logic · Mathematics 2013-11-06 Shohei Izawa

The dual character of invariance under transformations and definability by some operations has been used in classical work by for example Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves…

Logic · Mathematics 2018-02-21 Denis Bonnay , Fredrik Engström

Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Riccardo Pucella

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…

Logic · Mathematics 2019-08-06 Matthias Baaz , Richard Zach

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

Logic · Mathematics 2026-04-28 John T. Baldwin , Constantin C. Brîncuş

In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as close as possible to the Bayesian and is unrestricted, that is one is able to use any operator without restriction. A notion of…

Logic · Mathematics 2016-09-07 Frederic Dambreville

We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…

Logic in Computer Science · Computer Science 2023-05-16 Gilles Dowek , Ying Jiang

This chapter presents probability logic as a rationality framework for human reasoning under uncertainty. Selected formal-normative aspects of probability logic are discussed in the light of experimental evidence. Specifically, probability…

Artificial Intelligence · Computer Science 2019-10-16 Niki Pfeifer

The relational semantics of linear logic is a powerful framework for defining resource-aware models of the $\lambda$-calculus. However, its quantitative aspects are not reflected in the preorders and equational theories induced by these…

Logic in Computer Science · Computer Science 2026-04-30 Adrienne Lancelot , Giulio Manzonetto , Guy McCusker , Gabriele Vanoni

In computer science, various logical languages are defined to analyze properties of systems. One way to pinpoint the essential differences between those logics is to compare their expressivity in terms of distinguishing power and expressive…

Logic in Computer Science · Computer Science 2009-05-28 Yanjing Wang , Francien Dechesne