pith. sign in

arxiv: 2512.05214 · v2 · submitted 2025-12-04 · 🧮 math.LO

Towards a logic of affordances

Rafal Gruszczynski , Paula Mench\'on , Ivo D\"untsch , G\"unther Gediga This is my paper

Pith reviewed 2026-05-17 00:19 UTC · model grok-4.3

classification 🧮 math.LO
keywords affordancesternary relationsrough setsinformation systemsmodal operatorsapproximation operatorsGibsonPawlak
0
0 comments X

The pith

Affordances are defined as ternary relations in information systems, enabling modal and approximation operators for crisp and rough cases.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper builds a formal theory of affordances by representing them as ternary relations inside Pawlak information systems, starting from Gibson's ecological characterization. It supplies exact mathematical definitions that distinguish crisp affordances, which hold precisely, from rough affordances, which incorporate approximation. Modal operators and rough-set approximation operators are introduced to support reasoning about these relations. This matters for anyone who wants to turn informal ideas about what an environment offers into objects that logic can manipulate directly. The work therefore opens a route from psychology-inspired concepts to computable models of possibility and necessity.

Core claim

Beginning with a characterization of affordances proposed by James J. Gibson, and utilizing the tools provided by Zdzisław Pawlak's information systems and rough sets, we construct a mathematically precise definition of both crisp and rough affordances. Then, we analyze modal and approximation operators that enable reasoning about affordances in both scenarios.

What carries the argument

Ternary relations that model affordances inside Pawlak information systems, equipped with modal operators and rough-set approximations.

If this is right

  • Affordances become objects that modal logic can reason about directly.
  • Crisp cases permit exact deduction while rough cases handle uncertainty via approximations.
  • Information systems supply a concrete structure for representing agent-object-action triples.
  • Existing approximation and modal techniques from rough-set theory apply immediately to affordance reasoning.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same framework could be tested on dynamic environments where affordances change with agent movement or learning.
  • Robotics or AI perception modules might adopt the ternary-relation representation to ground action planning in sensed data.
  • Comparisons with other formal accounts of affordances in philosophy could clarify what ecological content is preserved or lost.

Load-bearing premise

Gibson's informal description of affordances can be captured by ternary relations in information systems without losing its essential ecological content.

What would settle it

Empirical data from psychology or ecology showing that the ternary-relation definitions systematically misclassify real observed action possibilities would falsify the modeling choice.

Figures

Figures reproduced from arXiv: 2512.05214 by G\"unther Gediga, Ivo D\"untsch, Paula Mench\'on, Rafal Gruszczynski.

Figure 1
Figure 1. Figure 1: Rough areas of knowledge Definition 3.2. Formally, a rough set is a pair [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The triples of vectors of the same color constitute the affordance 𝜑 and its corresponding action Act𝜑. We identify, respectively, actors, objects, and environments that cannot be distinguished by available properties [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The blue triples of vectors constitute an action dunk𝜑 of dunking a ball [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
read the original abstract

We aim to construct a formal theory of affordances seen as ternary relations. Beginning with a characterization of affordances proposed by James J. Gibson, and utilizing the tools provided by Zdzis{\l}aw Pawlak's information systems and rough sets, we construct a mathematically precise definition of both crisp and rough affordances. Then, we analyze modal and approximation operators that enable reasoning about affordances in both scenarios.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript develops a formal theory of affordances by modeling them as ternary relations inside Pawlak information systems. Starting from Gibson's characterization, it supplies mathematically precise definitions of both crisp and rough affordances and then examines the modal and approximation operators that support reasoning in each case.

Significance. A successful construction would supply a concrete logical apparatus for reasoning about action possibilities under uncertainty, linking rough-set approximation techniques to ecological psychology. The explicit treatment of both crisp and rough cases together with the associated operators constitutes a clear technical contribution if the ecological content is shown to be preserved.

major comments (2)
  1. [§3] §3 (Definition of crisp affordances): the ternary relation is stipulated directly inside the information table without an explicit clause or lemma establishing that the third argument encodes the animal-environment complementarity or invariance under transformation required by Gibson; the subsequent modal operators therefore operate on a structure whose ecological fidelity has not been verified.
  2. [§5] §5 (Modal and approximation operators): no theorem or proposition demonstrates that the defined operators respect direct perceivability independent of an observer's knowledge state; without such a result the claim that the framework enables reasoning about affordances in the Gibsonian sense remains unsupported.
minor comments (2)
  1. [Preliminaries] The preliminaries section would benefit from a small concrete information table illustrating how an affordance triple is entered before the general definitions are introduced.
  2. [Notation] A few typographical inconsistencies appear in the notation for the approximation operators; uniform use of the standard Pawlak symbols would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and constructive major comments. These observations help clarify how the formal constructions should be explicitly tied to Gibson's requirements. We respond point by point below and will revise the manuscript to incorporate the requested clarifications and supporting results.

read point-by-point responses

  1. Referee: [§3] §3 (Definition of crisp affordances): the ternary relation is stipulated directly inside the information table without an explicit clause or lemma establishing that the third argument encodes the animal-environment complementarity or invariance under transformation required by Gibson; the subsequent modal operators therefore operate on a structure whose ecological fidelity has not been verified.

    Authors: We agree that an explicit verification would strengthen the link to Gibson's characterization. The ternary relation in §3 is constructed precisely to capture the animal-environment complementarity as described in the opening sections. In the revised manuscript we will insert a short lemma immediately after Definition 3.1. The lemma will state that the third argument encodes the environmental feature relevant to the animal's action possibilities and that the relation remains invariant under the equivalence classes generated by the information system's attributes, thereby confirming ecological fidelity before the modal operators are introduced. revision: yes

  2. Referee: [§5] §5 (Modal and approximation operators): no theorem or proposition demonstrates that the defined operators respect direct perceivability independent of an observer's knowledge state; without such a result the claim that the framework enables reasoning about affordances in the Gibsonian sense remains unsupported.

    Authors: This is a fair criticism. For crisp affordances the operators act on the exact ternary relation, which by construction does not depend on further knowledge approximations. We will add a proposition in §5 establishing that the modal operators for crisp affordances evaluate independently of any observer-specific knowledge attributes. For the rough case we will add a corollary showing that the lower approximation isolates affordances perceivable with certainty, while the upper approximation bounds uncertainty without altering the direct-perception core. These results will support the claim that the framework permits Gibsonian reasoning. revision: yes

Circularity Check

0 steps flagged

No circularity: definitions constructed from external Gibson and Pawlak sources

full rationale

The paper begins from Gibson's informal characterization and Pawlak information systems as independent inputs, then defines crisp and rough affordances as ternary relations inside those systems. Modal and approximation operators are subsequently analyzed on the resulting structures. No equations reduce a derived quantity to a fitted parameter by construction, no self-citation supplies a load-bearing uniqueness theorem, and no ansatz is smuggled in. The construction is therefore self-contained as a formalization proposal rather than a tautological derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the assumption that affordances are adequately represented as ternary relations in information systems and that rough-set approximations preserve the relevant ecological meaning. No free parameters or invented entities are mentioned.

axioms (2)
  • domain assumption Affordances can be modeled as ternary relations between agents, objects, and actions within an information system.
    Stated as the starting point drawn from Gibson and formalized via Pawlak systems.
  • domain assumption Rough-set lower and upper approximations are appropriate for capturing uncertainty in affordance relations.
    Used to define the rough affordance variant.

pith-pipeline@v0.9.0 · 5363 in / 1230 out tokens · 53675 ms · 2026-05-17T00:19:31.127492+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    Chemero, A. (2003). An outline of a theory of affordances.Ecological Psychology, 15(2):181–195

    work page 2003

  2. [2]

    Codd, E. F. (1970). A relational model of data for large shared data banks.Commun. ACM, 13(6):377–387

    work page 1970

  3. [3]

    and Gediga, G

    Düntsch, I. and Gediga, G. (2000).Rough set data analysis: A road to non-invasive knowledge discovery. Metho𝛿os (UK), Bangor

    work page 2000

  4. [4]

    InProceedings of the 2002 IEEE International Conference on Data Mining (ICDM’02), pages 155–162

    Düntsch,I.andGediga,G.(2002).Modal-styleOperatorsinQualitativeDataAnalysis. InProceedings of the 2002 IEEE International Conference on Data Mining (ICDM’02), pages 155–162

    work page 2002

  5. [5]

    and Gediga, G

    Düntsch, I. and Gediga, G. (2003). Approximation operators in qualitative data analysis. In de Swart, H., Orłowska, E., Schmidt, G., and Roubens, M., editors,Theory and Application of Relational Structures as Knowledge Instruments, volume 2929 of Lecture Notes in ComputerScience, pages 214–230. Springer-Verlag, Heidelberg

    work page 2003

  6. [6]

    Düntsch, I., Gediga, G., and Lenarcic, A. (2009). Affordance relations. In Sakai, H., Chakraborty, M. K., Hassanien, A. E., Śle ¸zak, D., and Zhu, W., editors,Proceedings of theTwelfthInternationalConferenceonRoughSets,FuzzySets,DataMining&Granular Computing, volume 5908 ofLecture Notes in Computer Science, pages 1–11. Springer Verlag

    work page 2009

  7. [7]

    Düntsch, I., Gediga, G., and Orłowska, E. (2001). Relational attribute systems. International Journal of Human Computer Studies, 55(3):293–309

    work page 2001

  8. [8]

    Düntsch, I., Gediga, G., and Orłowska, E. (2007). Relational attribute systems II. Transactions on Rough Sets, 7:16–35. MR2397127

    work page 2007

  9. [9]

    Published online by Cambridge University Press, 15 November 2023

    Düntsch,I.,Gruszczyński,R.,andMenchón,P.(2023).Betweennessalgebras.Journal of Symbolic Logic, pages 1–25. Published online by Cambridge University Press, 15 November 2023

    work page 2023

  10. [10]

    Düntsch, I., Gruszczyński, R., and Menchón, P. (2024). A mixed logic with binary operators.https://arxiv.org/abs/2408.09581. To appear inJournal of Symbolic Logic

    work page arXiv 2024

  11. [11]

    (2015).The Ecological Approach to Visual Perception

    Gibson, J. (2015).The Ecological Approach to Visual Perception. Classic Edition. Psychology Press. First published 1979

    work page 2015

  12. [12]

    Lipski, Jr., W. (1977). On the logic of incomplete information. InMathematical foundationsofcomputerscience(Proc.SixthSympos.,TatranskáLomnica,1977),volume Vol. 53 ofLecture Notes in Comput. Sci., pages 374–381. Springer, Berlin-New York. MR460106

    work page 1977

  13. [13]

    G., editors (2024).The Modern Legacy of Gibson’s Affordances for the Sciences of Organism

    Mangalam, M., Hajnal, A., and Kelty-Stephen, D. G., editors (2024).The Modern Legacy of Gibson’s Affordances for the Sciences of Organism. Resources for Ecological Psychology. Routledge

    work page 2024

  14. [14]

    Theevolutionofroughsets1970s- 1981.https://arxiv.org/abs/2505.03747

    Marek, V., Orłowska, E., andDüntsch, I.(2025). Theevolutionofroughsets1970s- 1981.https://arxiv.org/abs/2505.03747

    work page arXiv 2025

  15. [15]

    Pawlak, Z. (1982). Rough sets.Internat. J. Comput. Inform. Sci., 11(5):341–356. MR703291

    work page 1982

  16. [16]

    Sahin, E., Cakmak, M., Dogar, M., Ugur, E., and Ucoluk, G. (2007). To Afford or Not to Afford: A New Formalization of Affordances Toward Affordance-Based Robot Control.Adaptive Behavior, 15(4):447

    work page 2007

  17. [17]

    Stoffregen, T. (2003). Affordances as properties of the animal environment system. Ecological Psychology, 15(2):115–134. 22 RAFAŁ GRUSZCZYŃSKI, PAULA MENCHÓN, IVO DÜNTSCH, AND GÜNTHER GEDIGA

    work page 2003

  18. [18]

    Informationsystems,similarityrelationsandmodallogics

    Vakarelov,D.(1998). Informationsystems,similarityrelationsandmodallogics. In Orłowska, E., editor,Incomplete information: Rough set analysis, volume 13 ofStud. Fuzziness Soft Comput., pages 492–550. Physica, Heidelberg. MR1647387

    work page 1998

  19. [19]

    Vakarelov, D. (2005). A modal characterization of indiscernibility and similarity relations in Pawlak’s information systems. In Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., and Yao, Y., editors,Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, pages 12–22, Berlin, Heidelberg. Springer Berlin Heidelberg

    work page 2005

  20. [20]

    Wille, R. (1982). Restructuring lattice theory: an approach based on hierarchies of concepts. InOrdered sets (Banff, Alta., 1981), volume 83 ofNATO Adv. Study Inst. Ser. C: Math. Phys. Sci., pages 445–470. Reidel, Dordrecht-Boston, Mass. MR0661303. Rafał Gruszczyński, Orcid: 0000-0002-3379-0577, Department of Logic, Nicolaus Copernicus University in Toruń...

    work page 1982