Search results

...ref>[[Heinz-Dieter Ebbinghaus]] ''Extended logics: the general framework'' in [[Jon Barwise|K. J. Barwise]] and [[Solomon Feferman|S. Feferman]], editors * [[Abstract logic]] ...

...ut|the Hegelian and Marxist method|the formalisation of dialectic in logic|Logic and dialectic}} {{Marxism–Leninism sidebar|expanded=concepts}} ...

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

...rchy''', introduced by [[Azriel Lévy]] in 1965, is a hierarchy of formulas in the [[formal language]] of the [[Zermelo–Fraenkel set theory]], which is ty In the language of set theory, [[atomic formula]]s are of the form x = y or x ...

...} In a conceptual space, ''points'' denote objects, and ''regions'' denote concepts. The theory of conceptual spaces is a theory about [[concept learning]] fir ...edge representation |series=[[Synthese]] library: studies in epistemology, logic, methodology, and philosophy of science |volume=359 |location=Cham |publish ...

...dia of Philosophy''. Accessed 18 November 2011.</ref> [[Common knowledge (logic)|Common knowledge]] is a related but stronger notion; any event that is com ...on, Oxford University Press, 1988. The first edition was published by OUP in 1972. Also, David Lewis, ''Convention'', Cambridge, MA: Harvard Universit ...

...ise]]s to be [[truth|true]] and the conclusion nevertheless to be [[False (logic)|false]].<ref>[http://www.iep.utm.edu/val-snd/ Validity and Soundness – Int ...ment terminology used in logic (en).svg|thumb|Argument terminology used in logic]] ...

...' 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 ...

{{Short description|Concept in mathematical logic}} ...iable over the integers. The dual concept to satisfiability is [[Validity (logic)|validity]]; a formula is ''valid'' if every assignment of values to its va ...

...philosophy at the [[University of Maryland]] from 1969 to 2009. He retired in 2009, but was awarded the position of emeritus professor, and continued to ...erred to as the 'Svenonius theorem' on decidability. One of his proponents in Sweden was [[Per Lindström]].<ref>''Handbook of world philosophy'' by John ...

...>Quine, W.V.O., ‘Three Grades of Modal Involvement’, ''Journal of Symbolic Logic'', 1953, 168-169.</ref> The derivation in Kripke's 'Identity and Necessity' is in three steps: ...

....org |publisher= Plenum |url= http://www.faqs.org/copyright/masters-theses-in-the-pure-and-applied-sciences-accepted-by-3/ |access-date= March 31, 2011}} Lightstone earned his PhD from the [[University of Toronto]] in 1955, under the supervision of Abraham Robinson; his thesis was entitled '' ...

{{short description|Many-valued logic in which truth values comprise a continuous range}} ...control.ee.ethz.ch/~apnoco/Script/15.pdf| url-status=dead}}</ref> of fuzzy logic. ...

...url=https://jainworld.com/library/jain-books/books-on-line/jainworld-books-in-indian-languages/first-steps-to-jainism-part-2/the-indian-jaina-dialectic-o ...and the Philosophical Basis of Pluralism|journal=History and Philosophy of Logic|date=2002|volume=23|issue=4 |pages=267–281|url=https://www.academia.edu/214 ...

...of sets. Randolph diagrams were created by mathematician John F. Randolph in 1965, during his tenure at the [[University of Arkansas]]. ...e applied to set theory as well. Throughout the paper, R-diagrams are used in conjunction with normal logical and set binary operation symbols. ...

{{Short description|Probabilistic logic programming language}} | genre = [[Probabilistic logic]] ...

...''', is a system for proving [[classical logic|classical]] [[propositional logic|propositional]] tautologies. * [[Completeness (logic)|Completeness]]: every propositional [[tautology (logic)|tautology]] has a ''P''-proof, ...

...tifiers is ambiguous. This thesis can be used to explain how some disputes in [[ontology]] are only due to a failure of the disagreeing parties to agree {{Main|Existential quantification|Quantification (logic)}} ...

...ional definition|intension]] (specifying conditions), using what is called in some ontology languages like [[Web Ontology Language|OWL]]. According to th ...bclass of collection. The second definition of class results in ontologies in which collections and classes are more fundamentally different. Classes may ...

...ersity Press</ref><ref>Perlovsky, L.I. (2006). Toward Physics of the Mind: Concepts, Emotions, Consciousness, and Symbols. Phys. Life Rev. 3(1), pp.22-55.</ref ...jointly with ''IEEE International Symposium on Computational Intelligence in Robotics and Automation (CIRA), Intelligent Systems and Semiotics (ISAS)''< ...