- relativized statement
- мат. релятивизированное высказывание
Большой англо-русский и русско-английский словарь. 2001.
relativized statement
Смотреть что такое "relativized statement" в других словарях:
Henry E. Kyburg, Jr. — Henry E. Kyburg, Jr. (1928 – 2007) was Gideon Burbank Professor of Moral Philosophy and Professor of Computer Science at the University of Rochester, New York, and Pace Eminent Scholar at The Institute for Human and Machine Cognition, Pensacola,… … Wikipedia
Projective hierarchy — In the mathematical field of descriptive set theory, a subset A of a Polish space X is projective if it is oldsymbol{Sigma}^1 n for some positive integer n. Here A is * oldsymbol{Sigma}^1 1 if A is analytic * oldsymbol{Pi}^1 n if the… … Wikipedia
science, philosophy of — Branch of philosophy that attempts to elucidate the nature of scientific inquiry observational procedures, patterns of argument, methods of representation and calculation, metaphysical presuppositions and evaluate the grounds of their validity… … Universalium
Self-refuting idea — Self refuting ideas are ideas or statements whose falsehood is a logical consequence of the act or situation of holding them to be true. Many ideas are accused by their detractors of being self refuting, and such accusations are therefore almost… … Wikipedia
Causality — (but not causation) denotes a necessary relationship between one event (called cause) and another event (called effect) which is the direct consequence (result) of the first. [http://dictionary.reference.com/search?q=Causality x=35 y=25 Random… … Wikipedia
Modal logic — is a type of formal logic that extends classical propositional and predicate logic to include operators expressing modality. Modals words that express modalities qualify a statement. For example, the statement John is happy might be qualified by… … Wikipedia
Low (complexity) — In computational complexity theory, it is said that a complexity class B is low for a complexity class A if A B = A ; that is, A with an oracle for B is equal to A . Such a statement implies that an abstract machine which solves problems in A… … Wikipedia
Phenomenology (The beginnings of) — The beginnings of phenomenology Husserl and his predecessors Richard Cobb Stevens Edmund Husserl was the founder of phenomenology, one of the principal movements of twentieth century philosophy. His principal contribution to philosophy was his… … History of philosophy
Post's theorem — In computability theory Post s theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. Background The statement of Post s theorem requires several concepts relating to definability and… … Wikipedia
Westminster Confession — As Puritan s rose to power in England in the 17th century, Parliament called a group of Puritan clergy to Westminster Abbey to make proposals for the further reform of the Church of England. The group met from 1643 to 1648 and produced a… … Encyclopedia of Protestantism
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
