default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Logic and Computation, Volume 35
Volume 35, Number 1, 2025
- Carlos Areces, Raul Fervari, Andrés R. Saravia, Fernando R. Velázquez-Quesada:
Uncertainty-based knowing how logic. 1-35 - Shay Allen Logan:
Nondeterministic and nonconcurrent computational semantics for BB+ and related logics. 36-56 - Philippe Balbiani, Quentin Gougeon:
Projective relative unification through duality. 57-80 - Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi:
Conjunctive degrees and cylinders. 81-94 - Alexander V. Gheorghiu
, David J. Pym:
Defining logical systems via algebraic constraints on proofs. 95-146 - Jiachao Wu, Hengfei Li:
Renovation sets and their applications in higher-order argumentation frameworks. 147-171 - Reinhard Kahle, Isabel Oitavem, Paulo Guilherme Santos:
Numeral completeness of weak theories of arithmetic. 172-193 - Correction to: Conjunctive degrees and cylinders. 194
Volume 35, Number 2, 2025
- Francisco N. Martínez-Aviña:
Changing the logic without changing the subject: the case of computability. - Marat Kh. Faizrahmanov:
Fixed point theorems for minimal numberings. - Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko:
Fuzzy bi-Gödel modal logic and its paraconsistent relatives. - Antoine Martina, Alexander Steen:
An encoding of abstract dialectical frameworks into higher-order logic. - Ethan Brauer:
Coarsening Natural Deduction Proofs I: Finding Perfect Proofs. - Birzhan S. Kalmurzayev, Nikolay A. Bazhenov, Alibek M. Iskakov:
Computably enumerable equivalence relations via primitive recursive reductions. - Yukihiro Oda, James Brotherston, Makoto Tatsuta:
The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions. - Sara Ayhan:
Meaning and identity of proofs in a bilateralist setting: A two-sorted typed Lambda-calculus for proofs and refutations. - Ethan Brauer:
Coarsening natural deduction proofs II: finding gaunt proofs. - João F. L. Alcântara, Renan Cordeiro:
Bipolar Argumentation Frameworks with a dual relation between defeat and defence. - Marija Boricic Joksimovic, Nebojsa Ikodinovic, Nenad Stojanovic:
Probability and natural deduction. - Ismael Calomino, Gustavo Pelaitay, William Javier Zuluaga Botero:
An alternative definition of tense operators on residuated lattices. - Andrey N. Frolov, Maxim V. Zubkov:
Low scattered linear orders. - Mikhail N. Rybakov, Dmitry Shkatov:
Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames. - Pawel Pawlowski, Daniel Skurt:
☐ and ◇ in eight-valued non-deterministic semantics for modal logics. - Haruka Kogure, Taishi Kurahashi:
On the conservation results for local reflection principles.
Volume 35, Number 3, 2025
- Hitoshi Furusawa, Walter Guttmann, Georg Struth:
Modal algebra of multirelations. - Belén Gimenez, Gustavo Pelaitay, William Zuluaga:
A Stone-type duality for semilattices with adjunctions. - Sergei Artemov:
Serial properties, selector proofs and the provability of consistency. - Neil Tennant:
Perfect proofs at first order. - Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema:
Logics with probabilistic team semantics and the Boolean negation. - Correction to: Checking trustworthiness of probabilistic computations in a typed natural deduction system.
- Esther Anna Corsi:
Attack principles in sequent-based argumentation theory. - Siqi Zhang, Xiaolin Qin, Ju Zhang, Jiang Liu:
Estimating event probabilities via signal temporal logic and first occurrence distributions. - Stefano Bonzio, Nicolò Zamperlin:
Modal weak Kleene logics: axiomatizations and relational semantics. - Sergey Drobyshevich:
Weak Belnapian modal logic. - Mohadese Nazifi, Mohsen Asghari Larimi, Mahmood Bakhshi:
Generalization of filter theory of EQ-algebras based on lattices. - Xiaoxuan Fu, Zhiguang Zhao:
Numerical expressive power of logical languages with cardinality comparison. - Janis Cirulis:
Remarks on skew Hilbert algebras and weak BCK*-algebras. - Mario Piazza, Matteo Tesi:
Analyticity with extra-logical information. - Correction to: Modalities combining two negations.
- Sabrine Ammar, Taoufik Sakka Rouis, Mohamed Tahar Bhiri:
A correct-by-construction approach for development of reliable planning problems. - Pawel Pawlowski, Thomas M. Ferguson, Ethan Gertler:
A Gödel-Dugundji-style theorem for the minimal structural logic. - Yuki Nishimura:
Completeness of tableau calculi for two-dimensional hybrid logics. - Huan Zhang, Songmao Zhang:
Necessary and sufficient conditions of the enforcement problem for various argumentation semantics. - Mihai Prunescu, Lorenzo Sauras Altuzarra:
Computational considerations on the representation of number-theoretic functions by arithmetic terms. - Bruno Da Ré, Damián Enrique Szmuc:
Non-deterministic semantics for cocanonical and semi-cocanonical deduction systems. - Theo A. F. Kuipers:
Nomic truthlikeness in the light of a probabilistic representation of propositions.
Volume 35, Number 4, 2025
- Correction to: Parameterized Complexity of Dynamic Belief Updates: A Complete Map.
- Marcelo E. Coniglio, Martín Figallo, Abilio Rodrigues:
Normalization and cut-elimination theorems for some logics of evidence and truth. - Didier Galmiche, Brandon Hornbeck, Daniel Méry:
Cut-free labelled calculi and decidability for intuitionistic sentential logic with identity. - Quentin Gougeon:
Computing most general unifiers in Euclidean modal logics. - Ivan Chajda, Helmut Länger, Antonio Ledda, Jan Paseka, Gandolfo Vergottini:
Tense logics based on posets. - Birzhan S. Kalmurzayev, Nikolay Bazhenov, Alibek M. Iskakov:
Undecidability of the degree structure of primitive recursive m-reducibility. - Václav Cenker, Ivan Chajda, Helmut Länger:
The variety of complemented lattices where conjunction and implication form an adjoint pair. - Theofanis Aravanis:
Tailoring disjoint belief structures to the AGM framework. - Supeng Wu, Xingliang Liang, Jiang Yang:
On α-state filters in state residuated lattices. - Dag Normann, Sam Sanders:
On some computational properties of open sets. - Sandro Preto, Marcelo Finger:
Nash meets Łukasiewicz: computing equilibria through logic. - Mikhail N. Rybakov, Dmitry Shkatov:
Polytime embedding of intuitionistic modal logics into their one-variable fragments. - Francesca Poggiolesi:
(Conceptual) explanations in logic. - Jean B. Nganou:
MV-frames. - Ruslan Enikeev:
To the logical foundations of random number generator construction.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-16 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
