On the Decidability of Intuitionistic Tense Logic without Disjunction
Authors: Fei Liang, Zhe Lin
IJCAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Using methods from algebraic proof theory, we show that the logic of tense implicative semi-lattices has the finite model property. Combining with the finite axiomatizability of the logic, it follows that the logic is decidable. |
| Researcher Affiliation | Academia | Fei Liang1,2 and Zhe Lin3 1School of Philosophy and Social Development, Shandong University, China 2Institute of Concept and Reasoning, Shandong University, China 3Department of Philosophy, Xiamen University, China |
| Pseudocode | No | The paper presents logical inference rules (e.g., in Definition 7) but does not include structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper is theoretical and does not mention providing open-source code for its methodology. |
| Open Datasets | No | The paper is theoretical and does not involve the use of datasets for training or any other purpose. |
| Dataset Splits | No | The paper is theoretical and does not involve datasets or their splits for validation or other purposes. |
| Hardware Specification | No | The paper is theoretical and does not involve computational experiments, thus no hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and does not discuss computational implementations or software dependencies. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details such as hyperparameters or training configurations. |