
	Where results make sense

Topic: Decidability (logic)

Related Topics

Austrian State Treaty

Boy George

Shrapnel

Kevin Federline

	Decidability (logic) - Wikipedia, the free encyclopedia
		A logical system or theory is decidable if the set of all well-formed formulas valid in the system is decidable.
		First-order logic is decidable if confined to predicates with only one argument.
		For example, the theory of algebraically closed fields is decidable but incomplete, whereas true arithmetic (the set of all true first-order statements about nonnegative integers in the language with + and ×) is complete but undecidable.
	en.wikipedia.org /wiki/Decidability_(logic) (265 words)

	Linear logic - Wikipedia, the free encyclopedia
		In mathematical logic, linear logic is a type of substructural logic that denies the structural rules of weakening and contraction.
		Linear logic was proposed by the French mathematician Jean-Yves Girard in 1987.
		Linear logic uses an idea from modal logic to embed the usual logic by means of a pair of exponential operators.
	en.wikipedia.org /wiki/Linear_logic (1479 words)

	BRICS Logic in Computer Science Seminar
		BRICS Logic Seminars.The seminars are the meeting point for the logic group at BRICS and for people interested in category theory and semantics.
		Logic of proofs formulated in the format `t is a proof of F' was found by S.Artemov in 1995.
		The decidability of HHPB for BPP is a new result, and is especially interesting, when considering that the decidability of HHPB is still open for finite-state systems.
	www.brics.dk /Activities/lics (1104 words)

	Decidability of Linear Affine Logic - Kopylov (ResearchIndex)
		Decidability of Linear Affine Logic - Kopylov (ResearchIndex)
		Abstract: The propositional Linear Logic is known to be undecidable.
		The proof is based on a reduction of Linear Affine Logic to sequents of specific "normal forms", and on a generalization of Kanovich computational interpretation of Linear Logic adapted to these "normal forms".
	citeseer.ist.psu.edu /482925.html (314 words)

	Citebase - Decidability of quantified propositional intuitionistic logic and S4 on trees
		Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers forall p, exists p over propositions.
		Kremer (1997) has shown that the quantified propositional intuitionistic logic Hπ+ based on the class of all partial orders is recursively isomorphic to full second-order logic.
		He raised the question of whether the logic resulting from restriction to trees is axiomatizable.
	citebase.eprints.org /cgi-bin/citations?id=oai:arXiv.org:math/0203113 (362 words)

	PHIL 2340: Decidability
		A yes-or-no question is decidable if there is a procedure that is guaranteed to give an answer to the question in a finite amount of time.
		A logical system such as a system of propositional logic or a system of first-order logic is decidable if, for every argument expressible in the language of the system, the question whether the argument is valid is decidable.
		So the basic problem with predicate logic is that, in order to determine whether there is a counterexample to an argument, we may need to consider an infinite number of distinct interpretations, and of course we can't exhaustively search an infinite number of cases, so the truth-table style investigation will not work.
	www.trinity.edu /cbrown/logic/decidability.html (1313 words)

	[No title] (Site not responding. Last check: 2007-11-03)
		Several consequences of this equivalence are presented, including decidability and undecidability results for variants of two-variable logics, which were used in previous work by the authors to analyse record structures.
		And, the authors' interpretation of * is sufficient to argue that first-order logic with spatial conjunction is as expressive as second-order logic, because it demonstrates an interpretation of the former into which the latter embeds.
		Symbolic Logic paper that they do reference as their reference for .) I found the 2004 TCS paper tremendously helpful for understanding the proof and model theory of separation logic* from multiple perspectives, and I am wondering whether this paper might provide the insights the authors need to strengthen their results.
	www.mit.edu /~vkuncak/papers/rejected/spatial-esop05.txt (1672 words)

	cv (Site not responding. Last check: 2007-11-03)
		Decidability results for metric and layered temporal logics.
		Decidability results for classes of purely universal formulae and quantifiers elimination in Set Theory.
		Deciding modal logics using tableaux and set theory.
	www.dimi.uniud.it /~policrit/cv.html (1353 words)

	Professor D
		A specific temporal logic is proposed, its mathematical properties studied and its range of applicability is demonstrated.
		Temporal Logic in Context of Databases (with I. Hodkinson)
		Logic Finite Automata and Constraint Logic Finite Automata (with Klaus Schulz)
	www.dcs.kcl.ac.uk /staff/dg/pubs/all.html (4548 words)

	First order logic: Soundness, Completeness, Decidability
		Decidability talks about if there exists an algorithmic way to decide if statements in a theory are true or false; obviously, if a theory is decidable then it is complete.
		Decidable sets are those for which there is an algorithm which determines whether an object belongs to that set or not.
		A theory is decidable if there is an algorithm which determines whether an arbitrary statement belongs to the theory.
	www.physicsforums.com /showthread.php?t=103975 (2592 words)

	Logic
		IOW, logic is the study of truth preserving inferences.
		However, instead of nonmonotonic logics, there is an extended discussion of resolution (in addition to modus ponens), and details of PROLOG design and implementation.
		Below is a table showing a survey of six AI texts and their coverage of logic.
	blackcat.brynmawr.edu /~dkumar/UGAI/logic.html (1385 words)

	First order logic: Soundness, Completeness, Decidability - Page 2
		For example, propositional logic is decidable, because it will be at most 2^n tests for each formula containing n variables.
		A set of axioms is decidable iff there is an ideal computer with an algorithm that can decide whether a given formula is in the set or not in the set.
		Generally, a set is decidable if there is an algorithm to determine whether an object belongs to that set or not.
	www.physicsforums.com /showthread.php?p=856165 (1434 words)

	Richard Zach: Decidability of quantified propositional intuitionistic logic and S4 on trees
		Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity ≤ ω
		Abstract: Quantified propositional intuitionistic logic is obtained from propositional intu-itionistic logic by adding quantifiers ∃p, ∀p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure.
		It is shown that if the Kripke structures are restricted to trees of at height and width at most ω, the resulting logics are decidable.
	www.ucalgary.ca /~rzach/papers/qpil.html (163 words)

	ECS EPrints Service - A Hybrid Intuitionistic Logic: Semantics and Decidability (Site not responding. Last check: 2007-11-03)
		EPrints is free software developed by the University of Southampton to facilitate Open Access to research.
		Chadha, R., Macedonio, D. and Sassone, V. A Hybrid Intuitionistic Logic: Semantics and Decidability.
		logic, then there is a finite birelational counter-model.
	eprints.ecs.soton.ac.uk /11850 (211 words)

	Decidability of model checking with the temporal logic EF. (Site not responding. Last check: 2007-11-03)
		Abstract: The branching-time temporal logic EF is a simple, but natural fragment of computation-tree logic (CTL) and the modal mu-calculus.
		We study the decidability of the model checking problem for EF and infinite-state systems.
		On the other hand, model checking with EF is decidable for PAD, a process model that subsumes both PA-processes and pushdown processes.
	www.informatik.uni-hamburg.de /TGI/pnbib/m/mayr_r3.html (185 words)

	Decidability of First Order Logic Queries Over Views (Site not responding. Last check: 2007-11-03)
		We study the problem of deciding satisfiability of first order logic queries over views, our aim being to delimit the boundary between the decidable and the undecidable fragments of this language.
		Our principal result is the identification of an important decidable class of queries over unary conjunctive views.
		This extends the decidability of the classical class of first order sentences over unary relations.
	www.cs.wright.edu /people/faculty/gdong/view_bd99_abstract.html (148 words)

	Modal Logic - Cambridge University Press (Site not responding. Last check: 2007-11-03)
		A textbook on modal logic, intended for readers already acquainted with the elements of formal logic, containing nearly 500 exercises.
		Modality is a rapidly expanding branch of logic, and familiarity with the subject is now regarded as a necessary part of every philosopher's technical equipment.
		Conditional logic; Select bibliography; Index of symbols; Index of schemas, rules, and systems, Index of subjects.
	www.cambridge.org /uk/catalogue/catalogue.asp?isbn=0521295157 (127 words)

	Decidability of a Temporal Logic Problem for Petri Nets. (Site not responding. Last check: 2007-11-03)
		Decidability of a Temporal Logic Problem for Petri Nets.
		It implies the decidability of the problem of the existence of an infinite weakly fair occurrence sequence for a given Petri net; thereby an open problem of H. Carstensen (1987) is solved.
		Keywords: decidability (of a) temporal logic problem; decision algorithm; infinite weakly fair occurrence sequence.
	www.informatik.uni-hamburg.de /TGI/pnbib/j/jancar_p9.html (107 words)

	Decidability
		Our goal is to prove decidability of propositional logic, i.e.
		But we know a proposition is not valid if and only if there is some full assignment which falsifies it.
		S) Using this logically equivalent form of unsatisfiability we state a computationally stronger version of the decidability theorem.
	www.cs.uwyo.edu /~jlc/prop_gloss/node18.html (269 words)

	Joel Ouaknine: On the decidability of metric temporal logic (Site not responding. Last check: 2007-11-03)
		Joel Ouaknine: On the decidability of metric temporal logic
		Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems.
		In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity.
	web.comlab.ox.ac.uk /oucl/work/joel.ouaknine/publications/mtl05abs.html (141 words)

	Process Logic: Expressiveness, Decidability, Completeness - Harel, Kozen, Parikh (ResearchIndex) (Site not responding. Last check: 2007-11-03)
		Harel, D. Kozen and R. Parikh, "Process logic: Expressiveness, decidability, completeness," Journal of Computer and System Sciences, vol.
		238 Decidability of second-order theories and automata on infini..
		124 Semantical considerations on Floyd-Hoare logic - PRATT - 1976
	citeseer.ist.psu.edu /548415.html (409 words)

	Prof. Dr. Denis Thérien: Decidability questions in temporal logic (Site not responding. Last check: 2007-11-03)
		Linear temporal logic is the most fundamental formalism used in computer-aided verification for specifying properties of both hardware and software.
		An important question is thus to decide for a given property if it is expressible or not in a given fragment.
		In particular, we will show that the levels of the Since/Until hierarchy are decidable, using algebraic methods.
	www.informatik.uni-stuttgart.de /kolloquium/SS01/Therien20010508.html (133 words)

	Rosati, Riccardo: On the decidability and complexity of integrating ontologies and rules (Site not responding. Last check: 2007-11-03)
		For these semantic extensions we present entailment rules, prove completeness results, prove that consistency is in P and that, just as for RDFS, entailment is NP-complete, and in P if the target graph does not contain blank nodes.
		There are no restrictions on use to obtain decidability: classes can be used as instances.
		We prove that entailment for RDF Schema (RDFS) is decidable, NP-complete, and in P if the target graph does not contain blank nodes.
	www.websemanticsjournal.org /ps/pub/2005-4 (374 words)

	A Hybrid Intuitionistic Logic: Semantics and Decidability -- Chadha et al. 16 (1): 27 -- Journal of Logic and ...
		A Hybrid Intuitionistic Logic: Semantics and Decidability -- Chadha et al.
		Center for Logic and Computation, IST, Lisboa 1049-001, Portugal.
		We study a hybrid intuitionistic modal logic suitable for reasoning
	logcom.oxfordjournals.org /cgi/content/short/16/1/27?rss=1 (191 words)

	Decidability of Linear Affine Logic (Site not responding. Last check: 2007-11-03)
		propositional linear logic is known to be undecidable.
		linear affine logic to sequents of specific "normal
		of Tenth Anual IEEE Symposium on Logic in Computer Science (LICS), San Diego, USA, June, 1995 (.ps file) / 10 pages
	www.its.caltech.edu /~kopylov/papers/llw (45 words)

Try your search on: Qwika (all wikis)