Search results

| series = [[Lecture Notes in Computer Science]] | title = Computer science logic (Utrecht, 1996) ...

...o-variable logic''' is the [[fragment (logics)|fragment]] of [[first-order logic]] where [[formula (logics)|formulae]] can be written using only two differe ...ion Problem for Two-Variable First-Order Logic'', The Bulletin of Symbolic Logic, Vol. ...

...er than the set of states. It was created by [[Grigore Roșu]] and is used in the K Framework. ...|first1=Grigore |title=Matching Logic |journal=Logical Methods in Computer Science |date=2017 |url=https://fsl.cs.illinois.edu/publications/rosu-2017-lmcs.pdf ...

...n | publisher = [[Springer-Verlag]] | series = [[Lecture Notes in Computer Science]] | volume = 443 | pages = [https://archive.org/details/automatalanguage000 ...> block of one path are labeled (<math>L(\sdot)</math>) the same as states in the <math>k^{\mathrm{th}}</math> block of the other path. Corresponding blo ...

...asoning |chapter=Gödel Logics – A Survey |series=Lecture Notes in Computer Science |date=2010 |volume=6397 |pages=30–51 |doi=10.1007/978-3-642-16242-8_4 |isbn ...]] showed that infinite-valued [[propositional logic|propositional]] Gödel logic can be axiomatised by adding the [[axiom schema]] ...

{{Short description|Logic for mathematics}} ...nd composition instructions and from the axioms of the [[data structure]]s in question see {{harvtxt|Mirkowska|Salwicki|1987}}, {{harvtxt|Banachowski|Kre ...

{{Short description|Type of temporal logic}} ...needed|computer science|reason=contains buzzwords that should be explained in a less technical manner|date=July 2017}} ...

In other words, the WSML provides means to formally describe the WSMO elements ...Logics|Description Logic]], [[First-order logic|First-order Logic]] and [[Logic Programming]].<ref>J. de Bruijn, H. Lausen, A. Polleres, D. Fensel: The WSM ...

{{Short description|Commonly used rules of replacement in propositional logic}} {{About|the rule of inference|the formula of absolute truth|Tautology (logic)|other uses|Tautology (disambiguation)}} ...

{{Short description|A normal form for modal logic formulae}} ....com/chapter/10.1007/3-540-52335-9_55}}</ref> is a normal form for [[modal logic]] formulae. ...

...t with unary symbols and constants can be considered as [[string (computer science)|strings]]. Higher arities lead to proper [[Tree (automata theory)|trees]]. For instance, in the term ...

...' is a [[function (mathematics)|function]] whose values are [[integer]]s. In other words, it is a function that assigns an integer to each member of its ...functions are ubiquitous in [[graph theory]]. They also have similar uses in [[geometric group theory]], where ''[[length function]]'' represents the co ...

In the mathematical discipline of [[category theory]], the '''Freyd cover''' o ...t it is like a [[Cone (topology)|cone]], but with the [[Sierpiński space]] in place of the [[unit interval]].<ref name=nlab/> ...

{{Short description|Fragment of first-order logic}} ...-0684|quote=CHCs are syntactically and semantically the same as constraint logic programs|doi-access=free |arxiv=2108.00739 }}</ref> ...

...ting of its [[Quantifier (logic)|quantifiers]]. It plays an essential role in [[model theory]]. ...ulae can have different quantifier ranks, when they express the same thing in different ways. ...

...rrow''' and the expression x ↦ y is called a '''maplet'''. In [[separation logic]] it denotes the contents of a specific cell of memory. In the [[Unicode]] character set, the symbol is code point U+21A6.<ref>[https: ...

{{Short description|Concept in theoretical computer science}} ...ved. The non-decreasing condition here means that the letters are received in the correct order. ...

In [[programming language]] [[type theory]], '''row polymorphism''' is a kind [[polymorphism (computer science)|polymorphism]] that allows one to write programs that are polymorphic on r ...

...nal equality''' to differentiate it from "judgemental equality". Equality in type theory is a complex topic and has been the subject of research, such a ...ntal notion is "judgemental equality", which is a [[Judgment (mathematical logic)|judgement]]. ...

{{Short description|Knowledge representation computer programming language}} ...h inductive definitions |journal=International Conference on Computational Logic |date=2000 |pages=703–717 |doi= |arxiv=cs/0003019 |bibcode=2000cs........30 ...