:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Petrukhin, Yaroslav
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2508.13928
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic
by: Petrukhin, Yaroslav
Published: (2024)

Bisequent Calculi for Neutral Free Logic with Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Uniform Cut-free Bisequent Calculi for Three-valued Logics
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)

Normalisation for Negative Free Logics without and with Definite Descriptions
by: Kürbis, Nils
Published: (2024)

Hybrid Modal Operators for Definite Descriptions
by: Wałęga, Przemysław Andrzej, et al.
Published: (2024)

Monadic Second-Order Logic of Permutations
by: Jelínek, Vít, et al.
Published: (2025)

Definite Descriptions and Hybrid Tense Logic
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Comodule Representations of Second-Order Functionals
by: Ahman, Danel, et al.
Published: (2024)

Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
by: Kurucz, Agi, et al.
Published: (2023)

The Complexity of Fragments of Second-Order HyperLTL
by: Regaud, Gaëtan, et al.
Published: (2025)

Partially Finite Model Reasoning in Description Logics Extended Version
by: Gogacz, Tomasz, et al.
Published: (2026)

First-Order LTLf Synthesis with Lookback (Extended Version)
by: Winkler, Sarah
Published: (2025)

Unification of Deterministic Higher-Order Patterns (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2026)

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2025)

The Parameterized Complexity of Learning Monadic Second-Order Logic
by: van Bergerem, Steffen, et al.
Published: (2023)

Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (Extended Version)
by: Baader, Franz, et al.
Published: (2025)

Non-Rigid Designators in Modal and Temporal Free Description Logics (Extended Version)
by: Artale, Alessandro, et al.
Published: (2024)

Incomplete Descriptions and Qualified Definiteness
by: Więckowski, Bartosz
Published: (2024)

The Complexity and Expressive Power of Second-Order Extended Logic
by: Feng, Shiguang, et al.
Published: (2022)

A General Automata Model for First-Order Temporal Logics (Extended Version)
by: Geatti, Luca, et al.
Published: (2024)

Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic (Extended Version)
by: Niederhauser, Johannes, et al.
Published: (2024)

Hammering Higher Order Set Theory
by: Brown, Chad E., et al.
Published: (2025)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
by: Aoto, Takahito, et al.
Published: (2024)

Proof-theoretic Semantics for Second-order Logic
by: Gheorghiu, Alexander V., et al.
Published: (2025)

Datalog-Expressibility for Monadic and Guarded Second-Order Logic
by: Bodirsky, Manuel, et al.
Published: (2020)

Approximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics (Extended Version)
by: Kettmann, Pascal, et al.
Published: (2025)

A Unified Automata-Theoretic Approach to LTLf Modulo Theories (Extended Version)
by: Faella, Marco, et al.
Published: (2024)

Monitoring Second-Order Hyperproperties
by: Beutner, Raven, et al.
Published: (2024)

Unravelling Cyclic First-Order Arithmetic
by: Leigh, Graham E., et al.
Published: (2025)

Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
by: Bacci, Giorgio, et al.
Published: (2025)

Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
by: Kettmann, Pascal, et al.
Published: (2026)

Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
by: Li, Kwing Hei, et al.
Published: (2025)

Structuring Definitions in Mathematical Libraries
by: Gusakov, Alena, et al.
Published: (2025)

On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
by: Haase, Christoph, et al.
Published: (2024)

A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
by: Pollaci, Samuele, et al.
Published: (2024)

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
by: Su, Wanyun, et al.
Published: (2024)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)