RO EN
Admissibility, compatibility, and deducibility in first-order sequent logics
Authors: Alexander Lyaletski
Keywords: First-order classical logic, first-order intuitionistic logic, first-order modal logic, sequent calculus, deducibility, admissibility, compatibility, coextensivity, validity
– 0.12 Mb
Keywords: First-order classical logic, first-order intuitionistic logic, first-order modal logic, sequent calculus, deducibility, admissibility, compatibility, coextensivity, validity
Abstract
The paper is about the notions of admissibility and compatibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules. Results on the coextensivity of the proposed sequent calculi with usual Gentzen and Kanger sequent calculi as well as with their equality and modal extensions are given.Taras Shevchenko National University of Kyiv
Address: Volodymyrska str., 64, 01601 Kyiv, Ukraine
Phone: (+38)(044)2293003
E-mail:
Address: Volodymyrska str., 64, 01601 Kyiv, Ukraine
Phone: (+38)(044)2293003
E-mail:
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
Fulltext
– 0.12 Mb
Contents
- Convex graph covers
- Set-theoretic Analysis of Nominative Data
- Admissibility, compatibility, and deducibility in first-order sequent logics
- Small P Systems with Catalysts or Anti-Matter Simulating Generalized Register Machines and Generalized Counter Automata
- Extensionality, Proper Classes, and Quantum Non-Individuality
- Edge detection in digital images using Ant Colony Optimization
- Probability on groups and an application to cryptography
- Classification of Early Stages of NAFLD Based on Dual Diagnostic Methods
- Annotation on PhD Thesis
