scientific article; zbMATH DE number 1439073

From MaRDI portal
Publication:4951398





In most logics, if a formula \( \varphi \) is deduced from a set of sentences \( \Gamma \), then \(\varphi \) is also deduced from an arbitrary set of sentences \( \Gamma ' \supseteq \Gamma \). This property is called monotonicity. In natural languages, various nonmonotonic reasonings are applied. This fact is well known. In the article, the author considers the possibility of formalizing nonmonotonic reasonings in model-theoretical terms with the help of a first-order logic. The notion of syntactical nearness of sentences of a predicate calculus is introduced.












This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4951398)