Use este identificador para citar ou linkar para este item:
https://repositorio.ufba.br/handle/ri/14883
Registro completo de metadados
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Lewitzka, Steffen | - |
dc.creator | Lewitzka, Steffen | - |
dc.date.accessioned | 2014-04-29T17:07:43Z | - |
dc.date.issued | 2012 | - |
dc.identifier.issn | 1367-0751 | - |
dc.identifier.uri | http://repositorio.ufba.br/ri/handle/ri/14883 | - |
dc.description | Texto completo: acesso restrito. p. 1083-1109 | pt_BR |
dc.description.abstract | Logics with quantifiers that range over a model-theoretic universe of propositions are interesting for several applications. For example, in the context of epistemic logic the knowledge axioms can be expressed by the single sentences ∀x.(Kix → x), and in a truth-theoretical context an analogue to Tarski's T-scheme can be expressed by the single axiom ∀x.(x:true ↔ x). In this article, we consider a first-order non-Fregean logic, originally developed by Sträter, which has a total truth predicate and is able to model propositional self-reference. We extend this logic by a connective ‘<’ for propositional reference and study semantic aspects. φ < ψ expresses that the proposition denoted by formula ψ says something about (refers to) the proposition denoted by φ. This connective is related to a syntactical reference relation on formulas and to a semantical reference relation on the propositional universe of a given model. Our goal is to construct a canonical model, i.e. a model that establishes an order-isomorphism from the set of sentences (modulo alpha-congruence) to the universe of propositions, where syntactical and semantical reference are the respective orderings. The construction is not trivial because of the impredicativity of quantifiers: the bound variable in ∃x.φ ranges over all propositions, in particular over the proposition denoted by ∃x.φ itself. Our construction combines ideas coming from Sträter's dissertation with the algebraic concept of a canonical domain, which is introduced and studied in this article. | pt_BR |
dc.language.iso | en | pt_BR |
dc.rights | Acesso Aberto | pt_BR |
dc.source | http://dx.doi.org/ 10.1093/jigpal/jzr050 | pt_BR |
dc.subject | Non-Fregean logic | pt_BR |
dc.subject | Propositional quantifiers | pt_BR |
dc.subject | Impredicativity | pt_BR |
dc.subject | Propositional (self-) reference | pt_BR |
dc.subject | Truth theory | pt_BR |
dc.title | Construction of a canonical model for a first-order non-Fregean logic with a connective for reference and a total truth predicate | pt_BR |
dc.title.alternative | Logic Journal of the IGPL | pt_BR |
dc.type | Artigo de Periódico | pt_BR |
dc.identifier.number | v. 84, n. 2 | pt_BR |
dc.embargo.liftdate | 10000-01-01 | - |
Aparece nas coleções: | Artigo Publicado em Periódico (IME) |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Steffen Lewitzka.pdf | 286,59 kB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.