Subminimal negation

A Colacito, D de Jongh, AL Vargas - Soft Computing, 2017 - Springer
Minimal logic, ie, intuitionistic logic without the ex falso principle, is investigated in its original
form with a negation symbol instead of a symbol denoting the contradiction. A Kripke …

Minimal and subminimal logic of negation

A Colacito - 2016 - eprints.illc.uva.nl
Starting from the original formulation of minimal propositional logic proposed by Johansson,
this thesis aims to investigate some of its relevant subsystems. The main focus is on …

On rules

R Iemhoff - Journal of Philosophical Logic, 2015 - Springer
On Rules | Journal of Philosophical Logic Skip to main content SpringerLink Log in Menu Find
a journal Publish with us Search Cart 1.Home 2.Journal of Philosophical Logic 3.Article On …

Temporal logic with overlap temporal relations generated by time states themselves

VV Rybakov - Сибирские электронные математические известия, 2020 - mathnet.ru
We study a temporal logic with non–standard temporal accessibility relations. This logic is
generated by semantic underground models, and any such a model has a base formed by a …

Strong decidability and strong recognizability

LL Maksimova, VF Yun - Algebra and Logic, 2017 - Springer
Extensions of Johansson's minimal logic J are considered. It is proved that families of
negative and nontrivial logics and a series of other families are strongly decidable over J …

Admissible bases via stable canonical rules

N Bezhanishvili, D Gabelaia, S Ghilardi, M Jibladze - Studia Logica, 2016 - Springer
Admissible Bases Via Stable Canonical Rules Page 1 Nick Bezhanishvili David Gabelaia
Silvio Ghilardi Mamuka Jibladze Admissible Bases Via Stable Canonical Rules Abstract. We …

Provability Games for Non-classical Logics: Mezhirov Game for , , and

A Pavlova - … Workshop on Logic, Language, Information, and …, 2021 - Springer
Game semantics provides an alternative view on basic logical concepts. Provability games,
ie, games for the validity of a formula provide a link between proof systems and semantics …

Сильная разрешимость и сильная узнаваемость

ЛЛ Максимова, ВФ Юн - Алгебра и логика, 2017 - mathnet.ru
При задании логик с помощью логических исчислений возникают естественные
алгоритмические проблемы распознавания свойств по аксиомам и правилам вывода. В …

Exact unification and admissibility

G Metcalfe, L Cabrer - Logical Methods in Computer Science, 2015 - lmcs.episciences.org
A new hierarchy of" exact" unification types is introduced, motivated by the study of
admissible rules for equational classes and non-classical logics. In this setting, unifiers of …

Preservation of admissible rules when combining logics

J Rasga, C Sernadas, A Sernadas - The Review of Symbolic Logic, 2016 - cambridge.org
Admissible rules are shown to be conservatively preserved by the meet-combination of a
wide class of logics. A basis is obtained for the resulting logic from bases given for the …