签名可交换性原则

Q1 Mathematics

Journal of Applied Logic Pub Date : 2016-05-01 DOI:10.1016/j.jal.2015.11.002

Tahel Ronel , Alena Vencovská

{"title":"签名可交换性原则","authors":"Tahel Ronel , Alena Vencovská","doi":"10.1016/j.jal.2015.11.002","DOIUrl":null,"url":null,"abstract":"<div><p>We investigate the notion of a <em>signature</em> in Polyadic Inductive Logic and study the probability functions satisfying the <em>Principle of Signature Exchangeability</em>. We prove a representation theorem for such functions on binary languages and show that they satisfy a binary version of the Principle of Instantial Relevance. We discuss polyadic versions of the Principle of Instantial Relevance and Johnson's Sufficientness Postulate.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"15 ","pages":"Pages 16-45"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2015.11.002","citationCount":"4","resultStr":"{\"title\":\"The principle of signature exchangeability\",\"authors\":\"Tahel Ronel , Alena Vencovská\",\"doi\":\"10.1016/j.jal.2015.11.002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We investigate the notion of a <em>signature</em> in Polyadic Inductive Logic and study the probability functions satisfying the <em>Principle of Signature Exchangeability</em>. We prove a representation theorem for such functions on binary languages and show that they satisfy a binary version of the Principle of Instantial Relevance. We discuss polyadic versions of the Principle of Instantial Relevance and Johnson's Sufficientness Postulate.</p></div>\",\"PeriodicalId\":54881,\"journal\":{\"name\":\"Journal of Applied Logic\",\"volume\":\"15 \",\"pages\":\"Pages 16-45\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.jal.2015.11.002\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S157086831500124X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Logic","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S157086831500124X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 4

摘要

研究了多进归纳逻辑中签名的概念，并研究了满足签名可交换性原则的概率函数。我们证明了这种函数在二进制语言上的表示定理，并证明了它们满足瞬时关联原理的二进制版本。我们讨论了即时关联原理和约翰逊充分性公设的多元版本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The principle of signature exchangeability

We investigate the notion of a signature in Polyadic Inductive Logic and study the probability functions satisfying the Principle of Signature Exchangeability. We prove a representation theorem for such functions on binary languages and show that they satisfy a binary version of the Principle of Instantial Relevance. We discuss polyadic versions of the Principle of Instantial Relevance and Johnson's Sufficientness Postulate.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊