eigenvariables, bracketing and the decidability of positive minimal     predicate logic

	eigenvariables, bracketing and the decidability of positive minimal predicate logic
	Dowek Gilles ; Jiang Ying
刊名	THEORETICAL COMPUTER SCIENCE
	2006
卷号	360 期号:1-3 页码:193-208
关键词	minimal logic system F sequent calculus positive quantifier bound variable decidability
ISSN号	0304-3975
学科主题	Computer Science ; Theory & Methods
收录类别	SCI ; EI
公开日期	2011-07-13
附注	We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The algorith
内容类型	期刊论文
源URL	[http://124.16.136.157/handle/311060/11480]
专题	软件研究所_计算机科学国家重点实验室 _期刊论文
推荐引用方式 GB/T 7714	Dowek Gilles,Jiang Ying. eigenvariables, bracketing and the decidability of positive minimal predicate logic[J]. THEORETICAL COMPUTER SCIENCE,2006,360(1-3):193-208.
APA	Dowek Gilles,&Jiang Ying.(2006).eigenvariables, bracketing and the decidability of positive minimal predicate logic.THEORETICAL COMPUTER SCIENCE,360(1-3),193-208.
MLA	Dowek Gilles,et al."eigenvariables, bracketing and the decidability of positive minimal predicate logic".THEORETICAL COMPUTER SCIENCE 360.1-3(2006):193-208.