DC FieldValueLanguage
dc.contributor.authorPerović, Aleksandaren
dc.contributor.authorDoder, Draganen
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorRašković, Miodragen
dc.date.accessioned2020-02-18T20:06:25Z-
dc.date.available2020-02-18T20:06:25Z-
dc.date.issued2016-01-01en
dc.identifier.issn0354-5180en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/22-
dc.description.abstractLet L be a countable first-order language such that its set of constant symbols Const(L) is countable. We provide a complete infinitary propositional logic (formulas remain finite sequences of symbols, but we use inference rules with countably many premises) for description of C-valued L-structures, where C is an infinite subset of Const(L). The purpose of such a formalism is to provide a general propositional framework for reasoning about F-valued evaluations of propositional formulas, where F is a C-valued L-structure. The prime examples of F are the field of rational numbers Q, its countable elementary extensions, its real and algebraic closures, the field of fractions Q(Ɛ), where " is a positive infinitesimal and so on.en
dc.publisherFaculty of Sciences and Mathematics, University of Niš, Serbia-
dc.relation.ispartofFilomaten
dc.subjectAxiomatization | Strong completeness | Weighted formulasen
dc.titleOn evaluations of propositional formulas in countable structuresen
dc.typeArticleen
dc.identifier.doi10.2298/FIL1601001Pen
dc.identifier.scopus2-s2.0-84966602681en
dc.relation.firstpage1-
dc.relation.lastpage13-
dc.relation.issue1-
dc.relation.volume30-
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

1
checked on Jul 12, 2024

Page view(s)

53
checked on May 10, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.