Proving Classical Theorems of Social Choice Theory in Modal Logic

Autonomous Agents and Multi-Agent Systems - Netherlands
doi 10.1007/s10458-016-9328-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Proving Theorems by Program Transformation

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

Some Classical Function Theory Theorems and Their Modern Versions

Annales de l'Institut Fourier
GeometryTopologyNumber TheoryAlgebra
1965English

Inductive Reasoning in Social Choice Theory

Journal of Logic, Language and Information
LinguisticsPhilosophyComputer ScienceLanguage
2019English

Modal Theorem Proving: An Equational Viewpoint

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
1992English

Neutrosophic Modal Logic

2017English

Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Modal Logic With Descriptions

Philosophical Studies
1984English

Using Representation Theorems for Proving Polynomials Non-Negative

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Agreement Theorems in Dynamic-Epistemic Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy