Title: TIME COMPLEXITY OF A PROOF{SEARCH PROCEDURE FOR K4
Abstract: In this paper, we will give the time complexity of the proof{search procedure given by a sequent system for K4 introduced in [9]. Here, the time complexity means the total number of applications of rules in the proof{search in the worst case for a given formula. We estimate the time complexity by using a certain order which guarantees termination of the proof{search procedure.
Publication Year: 2003
Publication Date: 2003-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot