NDLI: On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi

Content Provider	IEEE Xplore Digital Library
Author	Lyaletski, A.
Copyright Year	2008
Description	Author affiliation: Fac. of Cybern., Kyiv Nat. Taras Shevchenko Univ., Kiev, Ukraine (Lyaletski, A.)
Abstract	A unified approach is developed for constructing first-order cut-free sequent calculi without equality representing two classes of modal logics in dependence of whether classical logic or intuitionistic one is taken as a basis. It uses the original notions of admissibility and compatibility, which, in general, permits to avoid skolemization being a forbidden operation for the logics under consideration.Additionally, it requires the modal sequent calculi to satisfy a so-called principle-subformula condition. Following the approach, cut-free sequent modal calculi avoiding the dependence of inference search on different orders of quantifier rules applications are described. Results relating to the co-extensivity of various modal sequent calculi are given. The research gives a possibility to construct sound and complete methods for enough high efficient inference search in certain first-order modal logics if efficient technique for the handling of their propositional parts is available.
Starting Page	39
Ending Page	46
File Size	251993
Page Count	8
File Format	PDF
ISBN	9780769535234
DOI	10.1109/SYNASC.2008.92
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-09-26
Publisher Place	Romania
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	coextensivity modal logics Scientific computing Search methods intuitionistic logic Inference algorithms Calculus first-order sequent calculi Logic Application software Cybernetics classical logic
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A cut-free sequent calculus with ε-symbols.

Admissibility, compatibility, and deducibility in first-order sequent logics

Efficient loop-check for backward proof search in some non-classical propositional logics (1996).

Annotation-free sequent calculi for full intuitionistic linear logic ∗.

On Herbrand-like Theorems for Cut-free Modal Sequent Logics

Axiomatization of Credulous Reasoning in Default Logics using Sequent Calculus

Combining derivations and refutations for cut-free completeness in bi-intuitionistic logic.

Sufficient Conditions for Cut Elimination with Complexity Analysis

Proof search in first-order linear logic and other cut-free sequent calculi

On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi

Similar Documents

A cut-free sequent calculus with ε-symbols.

Admissibility, compatibility, and deducibility in first-order sequent logics

Efficient loop-check for backward proof search in some non-classical propositional logics (1996).

Annotation-free sequent calculi for full intuitionistic linear logic ∗.

On Herbrand-like Theorems for Cut-free Modal Sequent Logics

Axiomatization of Credulous Reasoning in Default Logics using Sequent Calculus

Combining derivations and refutations for cut-free completeness in bi-intuitionistic logic.

Sufficient Conditions for Cut Elimination with Complexity Analysis

Proof search in first-order linear logic and other cut-free sequent calculi

On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi