English
Related papers

Related papers: Visser frames for sublogics of $\mathbf{IL}$

200 papers

We prove a recognition principle for motivic infinite P1-loop spaces over a perfect field. This is achieved by developing a theory of framed motivic spaces, which is a motivic analogue of the theory of E-infinity-spaces. A framed motivic…

Algebraic Geometry · Mathematics 2021-07-12 Elden Elmanto , Marc Hoyois , Adeel A. Khan , Vladimir Sosnilo , Maria Yakerson

Controlled frames and g-frames were considered recently as generalizations of frames in Hilbert spaces. In this paper we generalize some of the known results in frame theory to controlled g-frames. We obtain some new properties of…

Functional Analysis · Mathematics 2019-12-19 Dongwei Li , Jinsong Leng

We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common…

Combinatorics · Mathematics 2020-07-08 Alireza Abdollahi , Russ Woodroofe , Gjergji Zaimi

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Logic in Computer Science · Computer Science 2016-06-24 Ori Lahav , João Marcos , Yoni Zohar

We analyze Parseval frames generated by the action of an ICC group on a Hilbert space. We parametrize the set of all such Parseval frames by operators in the commutant of the corresponding representation. We characterize when two such…

Functional Analysis · Mathematics 2008-11-21 Dorin Ervin Dutkay , Deguang Han , Gabriel Picioroaga

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…

Logic · Mathematics 2007-05-23 Georges Hansoul , Bruno Teheux

Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…

Logic in Computer Science · Computer Science 2024-04-24 Yevgeny Kazakov , Ian Pratt-Hartmann

In this paper, three semilinear substructural logics ULw, IULw and HpsUL*w are constructed. Then the completeness of ULw and IULw with respect to classes of finite UL and IUL-algebras, respectively, is proved. Algebraically, non-integral…

Logic · Mathematics 2018-04-26 SanMin Wang

We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…

Logic in Computer Science · Computer Science 2021-06-17 Jan Triska , Vilem Vychodil

We investigate the expressivity and computational complexity of two modal logics on finite forests equipped with operators to reason on submodels. The logic ML(|) extends the basic modal logic ML with the composition operator | from static…

Logic in Computer Science · Computer Science 2020-07-20 Bartosz Bednarczyk , Stéphane Demri , Raul Fervari , Alessio Mansutti

In this paper, we first present a classification theorem of infinite-dimensional simple Novikov algebras over an algebraically closed field with characteristic 0. Then we classify all the irreducible modules of a certain…

Quantum Algebra · Mathematics 2007-05-23 Xiaoping Xu

Frame theory is an exciting, dynamic and fast paced subject with applications in numerous fields of mathematics and engineering. In this paper we study Continuous Frame and introduce Continuous Frame with $C^{\ast}$-valued bounds. Also, we…

Functional Analysis · Mathematics 2022-09-05 Mohamed Rossafi , M'hamed Ghiati , Mohammed Mouniane , Frej Chouchene , Samir Kabbaj

We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras.…

Formal Languages and Automata Theory · Computer Science 2018-10-31 Silke Czarnetzki , Andreas Krebs , Klaus-Jörn Lange

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

In 1933, G\"odel considered two modal approaches to describing provability. One captured formal provability and resulted in the logic GL and Solovay's Completeness Theorem. The other was based on the modal logic S4 and led to Artemov's…

Logic · Mathematics 2014-05-13 Elena Nogina

We consider the standard quantum logic ${\mathcal L}(H)$ associated to a complex Hilbert space $H$, i.e. the lattice of closed subspaces of $H$ together with the orthogonal complementation. The orthogonality and compatibility relations are…

Functional Analysis · Mathematics 2017-02-13 Mark Pankov

In this paper we consider on the notion of continuous frame of subspace and define a new concept of continuous frame, entitled {\it continuous atomic resolution of identity}, for arbitrary Hilbert space $\h$ which has a countable…

Functional Analysis · Mathematics 2011-01-25 A. Fattahi , H. Javanshiri

We review the notion of (finitary) filter pair as a tool for creating and analyzing logics. A filter pair can be seen as a presentation of a logic, given by presenting its lattice of theories as the image of a lattice homomorphism, with…

Logic · Mathematics 2021-09-03 Peter Arndt , Hugo Luiz Mariano , Darllan Conceição Pinto

Justification logics are an explication of modal logic; boxes are replaced with proof terms formally through realisation theorems. This can be achieved syntactically using a cut-free proof system e.g. using sequent, hypersequent or nested…

Logic in Computer Science · Computer Science 2025-07-15 Sonia Marin , Paaras Padhiar
‹ Prev 1 8 9 10 Next ›