101010.pl is one of the many independent Mastodon servers you can use to participate in the fediverse.
101010.pl czyli najstarszy polski serwer Mastodon. Posiadamy wpisy do 2048 znaków.

Server stats:

509
active users

#ModalLogic

0 posts0 participants0 posts today
CubeRootOfTrue<p>$Trump ordered government agencies to prepare for mining the ocean floor.</p><p>Just because it is legal does not mean you should do it. Permission is not obligation.</p><p>Just say no. They have no power if you ignore them.</p><p><a href="https://mathstodon.xyz/tags/JustSayNo" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>JustSayNo</span></a> <a href="https://mathstodon.xyz/tags/ModalLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ModalLogic</span></a> <a href="https://mathstodon.xyz/tags/RM3" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>RM3</span></a></p>
Jesper Agdakx 🔸With the NWO XL consortium on Cyclic Structures in Programs and Proofs, we are looking for 6 highly motivated and talented PhD students starting in September (with some flexibility).<br><br>The topics range from Modal logic, proof theory, and coalgebras to Programming languages, concurrency, and type systems and Proof assistants (#Agda, <a class="hashtag" href="https://agda.club/tag/rocq" rel="nofollow noopener" target="_blank">#Rocq</a>).<br><br>Information about the positions and application procedure can be found on the website:<br><br><a href="https://cyclic-structures.gitlab.io/vacancies/" rel="nofollow noopener" target="_blank">cyclic-structures.gitlab.io/vacancies/</a><br><br>Please forward to any strong candidates you know!<br><br><a class="hashtag" href="https://agda.club/tag/typetheory" rel="nofollow noopener" target="_blank">#TypeTheory</a> <a class="hashtag" href="https://agda.club/tag/modallogic" rel="nofollow noopener" target="_blank">#ModalLogic</a> <a class="hashtag" href="https://agda.club/tag/concurrency" rel="nofollow noopener" target="_blank">#Concurrency</a> <a class="hashtag" href="https://agda.club/tag/programminglanguages" rel="nofollow noopener" target="_blank">#ProgrammingLanguages</a> <a class="hashtag" href="https://agda.club/tag/typesystems" rel="nofollow noopener" target="_blank">#TypeSystems</a> <a class="hashtag" href="https://agda.club/tag/proofassistants" rel="nofollow noopener" target="_blank">#ProofAssistants</a> <a class="hashtag" href="https://agda.club/tag/cyclicstructures" rel="nofollow noopener" target="_blank">#CyclicStructures</a> <a class="hashtag" href="https://agda.club/tag/phd" rel="nofollow noopener" target="_blank">#PhD</a> <a class="hashtag" href="https://agda.club/tag/netherlands" rel="nofollow noopener" target="_blank">#Netherlands</a> <a class="hashtag" href="https://agda.club/tag/universityofgroningen" rel="nofollow noopener" target="_blank">#UniversityOfGroningen</a> <a class="hashtag" href="https://agda.club/tag/leidenuniversity" rel="nofollow noopener" target="_blank">#LeidenUniversity</a> <a class="hashtag" href="https://agda.club/tag/universityoftwente" rel="nofollow noopener" target="_blank">#UniversityOfTwente</a> <a class="hashtag" href="https://agda.club/tag/tudelft" rel="nofollow noopener" target="_blank">#TUDelft</a> <a class="hashtag" href="https://agda.club/tag/radbouduniversity" rel="nofollow noopener" target="_blank">#RadboudUniversity</a>
HoldMyType<p>contd<br>Here is what I consider one of the biggest<br>mistakes of all in <a href="https://mathstodon.xyz/tags/modallogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>modallogic</span></a>: concentration on a system with just one<br>modal operator. The only way to have any philosophically significant re-<br>sults in deontic logic or epistemic logic is to combine those operators with:<br>tense operators (otherwise how can you formulate principles of change?);<br>the logical operators (otherwise how can you compare the relative with<br>the absolute?); the operators like historical or physical necessity (otherwise<br>how can you relate the agent to his environment?); and so on and so on.<br>But where to stop? This list can be extended further and further. One<br>must stop somewhere, but to stop the list at one is obviously missing out<br>on something important. The point I am trying to make is that the<br>semantics being explained here allows for several operators side by side<br>in a simple convenient. and natural way: one has only to think what<br>coordinates i = (w, t, p. a . ... ) one wants. Furthermore one should not<br>forget the logical operators.</p>
RanaldClouston<p>Later this week, or maybe next week, on my <a href="https://fediscience.org/tags/blog" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>blog</span></a> I'll be writing about Davies and Pfenning's 'A Modal Analysis of Staged Computation' <a href="https://dl.acm.org/doi/abs/10.1145/382780.382785" rel="nofollow noopener" target="_blank"><span class="invisible">https://</span><span class="ellipsis">dl.acm.org/doi/abs/10.1145/382</span><span class="invisible">780.382785</span></a> <a href="https://fediscience.org/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Logic</span></a> <a href="https://fediscience.org/tags/ModalLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ModalLogic</span></a></p>
José A. Alonso<p>Advancing automated theorem proving for the modal logics D and S5. ~ Jens Otten. <a href="https://ceur-ws.org/Vol-3326/ARQNL2022_paper5.pdf" rel="nofollow noopener" target="_blank"><span class="invisible">https://</span><span class="ellipsis">ceur-ws.org/Vol-3326/ARQNL2022</span><span class="invisible">_paper5.pdf</span></a> <a href="https://mathstodon.xyz/tags/ATP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ATP</span></a> <a href="https://mathstodon.xyz/tags/ModalLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ModalLogic</span></a> <a href="https://mathstodon.xyz/tags/MleanCoP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MleanCoP</span></a> <a href="https://mathstodon.xyz/tags/nanoCoPM" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>nanoCoPM</span></a></p>
Leonardo Pacheco<p>I find 𝐾𝑃→𝑃 a quite reasonable axiom for epistemic logic. In an intuitive sense, one cannot know something false, that’s not knowing. But i find the dual 𝑃→𝐾̂𝑃 not satisfying. I’ve seen explanations of the dual modality 𝐾̂ as “epistemic possibility”; but I don’t think truth does not implies epistemic possibility.</p><p><a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Logic</span></a> <a href="https://mathstodon.xyz/tags/ModalLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ModalLogic</span></a> <a href="https://mathstodon.xyz/tags/EpistemicLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>EpistemicLogic</span></a></p>