Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 2

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  CMOREJ PAVEL
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Content available remote

Cmorej a Tichý o jazyce a jeho logické analýze

100%
Raclavsky J.
Slovo a slovesnost: časopis pro otázky teorie a kultury jazyka (Slovo a slovesnost: A journal for the theory of language and language cultivation)
|
2006
|
vol. 67
|
issue 1
27-35
EN
Slovak logician Pavel Cmorej has recently opened up the question of the nature of logical analysis of natural language in a new way. He shows, for example, that attributing meaning to some meaningful language expression is an a priori and analytic statement, if a language is examined as a given. This is because a meaningful expression is best conceived as a pair consisting of a semi-expression and an assigned meaning. I show that these claims as well as many other observations are fully compatible with the late Czech philosopher and logician Pavel Tichy's specific concept of language as a code system.
2

THE SEMANTICS OF EMPIRICAL UNVERIFIABILITY

88%
Sedlár I.
Organon F. medzinárodný časopis pre analytickú filozofiu
|
2015
|
vol. 22
|
issue 3
358 – 377
EN
Pavel Cmorej has argued that the existence of unverifiable and unfalsifiable empirical propositions follows from certain plausible assumptions concerning the notions of possibility and verification. Cmorej proves, it the context of a bi-modal alethic-epistemic axiom system AM4, that (1) ρ and it is not verified that ρ is unverifiable; (2) ρ or it is falsified that ρ is unfalsifiable; (3) every unverifiable ρ is logically equivalent to ρ and it is not verifiable that ρ ; (4) every unverifiable ρ entails that ρ is unverifiable. This article elaborates on Cmorej’s results in three ways. Firstly, we formulate a version of neighbourhood semantics for AM4 and prove completeness. This allows us to replace Cmorej’s axiomatic derivations with simple model-theoretic arguments. Secondly, we link Cmorej’s results to two well-known paradoxes, namely Moore’s Paradox and the Knowability Paradox. Thirdly, we generalise Cmorej’s results, show them to be independent of each other and argue that results (3) and (4) are independent of any assumptions concerning the notion of verification.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.