论文信息 - The ∀∃ Theory of Peano σ1 Sentences - 字舞流文

The ∀∃ Theory of Peano σ1 Sentences

We present a decision procedure for the ∀∃ theory of the lattice of Σ1 sentences of Peano Arithmetic.

Per Lindström | V. Yu. Shavrukov | Per Lindström | V. Shavrukov

[1] D. Guaspari,et al. Partially conservative extensions of arithmetic , 1979 .

[2] Oystein Ore,et al. Mappings of Closure Relations , 1946 .

[3] Jan van Eijck,et al. Modal Logic, Transition Systems and Processes , 1993, J. Log. Comput..

[4] Yuri Gurevich. Decision Problem for Separated Distributive Lattices , 1983, J. Symb. Log..

[5] A. Lachlan. The elementary theory of recursively enumerable sets , 1968 .

[6] D.H.J. de Jongh,et al. The logic of the provability , 1998 .

[7] R. Solovay. Provability interpretations of modal logic , 1976 .

[8] M. Lerman. On elementary theories of some lattices or α-recursively enumerable sets , 1978 .

[9] V. Yu. Shavrukov. Effectively inseparable Boolean algebras in lattices of sentences , 2010, Arch. Math. Log..

[10] Michael Stob,et al. The intervals of the lattice of recursively enumerable sets determined by major subsets , 1983, Ann. Pure Appl. Log..

[11] Per Lindström. On faithful interpretability , 1984 .